Académique Documents
Professionnel Documents
Culture Documents
EduRev
(/)
Login New User
For any two positive integers a and b there exist unique integers q and r such that
a = bq + r, where 0 ≤ r < b.
e.g. (i)
23 = 5 × 4 + 3
Comparing with a = bq + r
(ii)
18 = 4 × 4 + 2
https://edurev.in/studytube/Euclid-Division-Lemma-Real-Numbers--Class-10-Mathematics/e9ce3dd9-1d25-45ab-91ae-d95668080d74_t 1/8
3/29/2018 Euclid Division Lemma - Real Numbers, Class 10 Mathematics | EduRev
In the relation a = bq + r, where 0 ≤ r < b is nothing but a statement of the long division of
number a by b in which q is the quotient obtained and r is the remainder.
Ex. 1 Use Euclid's division lemma to show that the square of any positive integer is
either of the form 3m or 3m +1 for some interger m.
Sol.
Let a and b are two positive integers such that a is greater than b, then :
Taking b = 3, we get:
3q + 0, 3q + 1 or 3q + 2
i.e., 3q, 3q + 1 or 3q + 2.
Now we have to show that the square of positive integers 3q, 3q + 1 and 3q + 2 can be
expressed as 3m or 3m + 1 for some integer m.
∴ Square of 3q = (3q)2
= 9q2 + 6q + 1
= 9q2 + 12q + 4
= 9q2 + 12q + 3 + 1
∴ The square of any positive integer is either of the form 3m or 3m + 1 for some integer m.
Ex. 2 Show that one and only one out of n; n + 2 or n + 4 is divisible by 3, where n is
any positive integer.
Sol.
https://edurev.in/studytube/Euclid-Division-Lemma-Real-Numbers--Class-10-Mathematics/e9ce3dd9-1d25-45ab-91ae-d95668080d74_t 2/8
3/29/2018 Euclid Division Lemma - Real Numbers, Class 10 Mathematics | EduRev
Consider any two positive integers a and b such that a is greater than b, then according to
Euclid's division algorithm
a = bq + r ⇒ n = 3q + r; where 0 ≤ r < 3.
r = 0 ⇒ n = 3q + 0 = 3q
r = 1 ⇒ n = 3q + 1
and r = 2 ⇒ n = 3q + 2
If n = 3q; n is divisible by 3
If n = 3q + 1; then n + 2 = 3q + 1 + 2
= 3q + 3; which is divisible by 3
⇒ n + 2 is divisible by 3
If n = 3q + 2; then n + 4 = 3q + 2 + 4
= 3q + 6; which is divisible by 3
⇒ n + 4 is divisible by 3
Hence, if n is any positive integer, then one and only one out of n, n + 2 or n + 4 is
divisible by 3.
Algorithm :
418 = 33 × 12 + 22
Step.(b) Now taking the divisor 33 and remainder 22, apply the Euclid's division method to
get.
https://edurev.in/studytube/Euclid-Division-Lemma-Real-Numbers--Class-10-Mathematics/e9ce3dd9-1d25-45ab-91ae-d95668080d74_t 3/8
3/29/2018 Euclid Division Lemma - Real Numbers, Class 10 Mathematics | EduRev
33 = 22 × 1 + 11 [Expressing as a = bq + r]
Step.(c) Again with new divisior 22 and new remainder 11, apply the Euclid's division
algorithm to get
22 = 11 × 2 + 0
Ex.3 Use Euclid's algorithm to find the HCF of 4052 and 12576.
Sol.
⇒ 148 = 124 × 1 + 24
⇒ 124 = 24 × 5 + 4
⇒ 24 = 4 × 6 + 0
The remainder at this stage is 0. So, the divisor at this stage, i.e., 4 is the HCF of 12576
and 4052.
Ex.4 Use Euclid's algorithm to find the HCF of 1848 and 3058.
Sol. Two numbers 1848 and 3058, where 3058 > 1848
1848 = 1210 × 1 + 638 [Using Euclid's division algorithm to the given number 1848 and
3058]
638 = 572 × 1 + 66
572 = 66 × 8 + 44
https://edurev.in/studytube/Euclid-Division-Lemma-Real-Numbers--Class-10-Mathematics/e9ce3dd9-1d25-45ab-91ae-d95668080d74_t 4/8
3/29/2018 Euclid Division Lemma - Real Numbers, Class 10 Mathematics | EduRev
66 = 44 × 1 + 22
44 = 22 × 2 + 0
Ex.5 Use Euclid's algorithm to find the HCF of 1331 and 22.
1331 = 22 × 60 + 11
22 = 11 × 2 + 10
Hence the HCF of the three given numbers 1848, 3058 and 1331 is 11.
Ex.6 Using Euclid's division, find the HCF of 56, 96 and 404 [Sample paper
(CBSE)-2008]
96 = 56 × 1 + 40
56 = 40 × 1 + 16
40 = 16 × 2 + 8
16 = 8 × 2 + 0
404 = 8 × 50 + 4
A L S O R E C O M M E N D E D F O R YO U
https://edurev.in/studytube/Euclid-Division-Lemma-Real-Numbers--Class-10-Mathematics/e9ce3dd9-1d25-45ab-91ae-d95668080d74_t 5/8