Question

use euclids division algorithm to find hcf of: (i) 135 and 225 (ii) 196 and 38220
Plz find with Expalanation
It is my Home Work​

Answer 1

Answer:

a = b.q + r

it's Euclid division lemma formula

where a = biggest no. among two no.

b = smallest no.

q = multiple

r = remainder

Step-by-step explanation:

Hope it will helps you dear friend

Answer 2

Answer:

make me as brainliest and thank me if the answer is useful.

Step-by-step explanation:

By Euclid's division lemma,

225=135×1+90

r=90

135=90×1+45

r=4

90=45×2+0

So,  H.C.F of 135 and 225 is 4

(ii) By Euclid's division lemma,

38220=196×195+0r=0

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

(iii) By Euclid's division lemma,

867=255×3+102

r=10

255=102×2+51

r=51

102=51×2+0

So, H.C.F of 867 and 255 is 51

The highest HCF among the three is 196.