Question

Find the HCF of 72 and 96 by Euclid's division algorithm and express it in the form 96m+72ñ

Answer 1

Answer:

Euclid's Division Lemma :

Given positive integers a and b ,

there exists unique integers q and r

satisfying

a = bq + r ,

Where 0 less than or equal to r

___________________________

Applying Euclid's Division algorithm

to 72 and 96 , we get

96 = 72 × 1 + 24 ----( 1 )

72 = 24 × 3 + 0 -----( 2 )

Therefore 24 is the HCF of 72 and 96

From ( 1 ),

24 = 96 - 72 × 1

= 96 ( 1 ) + 72 × ( - 1 )

It is in the form of

= 96m + 72n

I hope this helps you.