You are here
-lock-
-endlock-
Question 2 - Euclid's Division Algorithm - Proving - Chapter 1 Class 10 Real Numbers
Last updated at August 5, 2026 by Teachoo
Euclid's Division Algorithm - Proving
Chapter 1 Class 10 Real Numbers
Concept wise
- Introduction
- HCF using Euclid's Division Algorithm
-
Euclid's Division Algorithm - Proving
- Prime Factorization
- LCM/HCF
- Decimal Expansion
- Irrational numbers
Take a fresh quiz. Then take another.
Every attempt is a new AI-adaptive Teachoo quiz with 3 questions, selected from your answers, mistakes, and progress.
Transcript
Ex 1.1 , 2 Show that any positive odd integer is of the form 6q + 1, or 6q+ 3, or 6q+ 5, where q is some integer. As per Euclid’s Division Lemma If a and b are 2 positive integers, then a = bq + r where 0 ≤ r < b Let positive integer be a And b = 6 Hence a = 6q + r where ( 0 ≤ r < 6) r is an integer greater than or equal to 0 and less than 6 hence r can be either 0 , 1 , 2 ,3 , 4 or 5 Therefore, any odd integer is of the form 6q + 1, 6q + 3 or 6q + 5 Hence proved
