Question

Find the HCF of 135 and 224 using Euclid division algorithm​

Answer 1

Answer:

3 is the right answer....................

Answer 2

Answer:

let a= 224 and b= 135

then by E. D. L

224= 135×1+89

since remainder is not equal to 0 , we apply the division lemma to 135 and 89

135= 89×1+46

since remainder is not equal to 0 , we apply the division lemma to 89 and 46

89=46×1+43

since remainder is not equal to 0 we apply the division lemma to 46 and 43

46=43×1+3

since remainder is not equal to 0,we apply the division lemma to 43 and 3

43= 3× 14+1

since remainder is not equal to 0 , we apply the division lemma to 3 and 1

3= 1×3+0

since remainder =0

so H.C.F= 1