Question

Using Euclid's division algorithm,find the H.C.F of 135 and 225.​

Answer 1

Answer -

According to the euclid's division lemma, if there are two positive integers a and B then there exist a unique integers q and r such that a=bq+r

0<r<b

a<b

225= 135 * 1 + 90

135 = 90 *1 + 45

90 = 45 * 2 + 0

Here b = 45

Therefore ore has is equal to 45

Hope it helps

Answer 2

my answer is same as the upper