Question

question 1 -Use Euclid's division algorithm to find the HCF of: 135 and 225 (ii) 196 and 38220 (3) 867 and 255 ​

Answer 1

$\mathbf\red{{answer\::-}}$

• The HCF of 135 and 225, 196 and 38220, and 867 and 255 using Euclid's division algorithm are 45, 196, and 51 respectively.
• hope it will help uh!
• mark as brainlist!

Answer 2

Answer:

and is 196

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 of 135 and 225 is 45

(ii) By Euclid's division lemma,

38220=196×195+0

r=0

So, H.C.F of 38220 and 196 is 196

(iii) By Euclid's division lemma,

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 the three is 196