Question

Find the HCF of two numbers by using Euclid division Lamma

Answer 1

Heya!

Here is yr answer....


Euclid's division Lemma :
~~~~~~~~~~~~~~~~~~~~~~

Let 'a' and 'b' are any positive integers.... Their exist a unique pair of integers.... q, r which satisfy ---

a = bq + r [ 0<r< / = b]


Hope it hlpz..

Answer 2

135 and 225 since 225>135 is bigger we use eucli algorithm 225=135×1+90 since the remainder 90 we use euclid algorithm 135and 90 ,135=90×1+45 remainder is 45 lets we use euvlid algorithm 90 =45×2+0 remainder is o

hence the hcf of 135 and 225 is 45