Use Euclid division algorithm to find the HCF.
1. 135 and 225
Dividend = Divisor ×Q × R
a= b×2+R
225 = 135 × 1 + 90
135 = 90 × 1 + 45
90 = 45 × 2 +0
HCF of 135 and 225 =45
Answers
Answered by
0
Answer:
a=225, b=135
now,
by Euclid's algorithm
a=b×q+r
225=135×1+90
135=90×1+45
90=45×2+0
here,
Last divisor b=45 when r=0
HCF=45
Similar questions