EXERCISE 1.1
1. Use Euclid's division algorithm to find the HCF of:
(1) 135 and 225 h 5
(i) 196 and 38220 196
(ii) 867 and 255
)
Answers
Step-by-step explanation:
(i) By Euclid's division lemma
225=135×1+90
r=90
=0
135=90×1+45
r=45
=0
90=45×2+0
r=0
So,H.C.F of135 and 225 is 45
(ii) By Euclid's division
38220=196×195+0
r=0
So, H.C.F of 38220 and 196 is 196
(iii) By Euclid's division
867=255×3+102
r=102
=0
255=102×2+51
r=51
=0
102=51×2+0
r=0
So, H.C.F of 867 and 255 is 51
The highest HCF among three is 196.
Answered By
What would you like to ask?
10th
Maths
Real Numbers
Euclid's Division Lemma
Use Euclid's division algor...
MATHS
Use Euclid's division algorithm to find the HCF of:
(i) 135 and 225 (ii) 196 and 38220 (iii) 867 and 255. Enter the highest HCF amongst the following.
MEDIUM
Share
Study later
ANSWER
(i) By Euclid's division lemma
225=135×1+90
r=90
=0
135=90×1+45
r=45
=0
90=45×2+0
r=0
So,H.C.F of135 and 225 is 45
(ii) By Euclid's division
38220=196×195+0
r=0
So, H.C.F of 38220 and 196 is 196
(iii) By Euclid's division
867=255×3+102
r=102
=0
255=102×2+51
r=51
=0
102=51×2+0
r=0
So, H.C.F of 867 and 255 is 51
The highest HCF among three is 196.