Question

using euelid division algorithn to find the HCF of the following
1288,576

Answer 1

here is ur answer..............

Answer 2

Hey!!

We have 1288, 576

By Euclid's Division Lemma or algorithm

a = bq + r where 0 < r < b

For a = 1288 b = 576

1288 = 576 × 2 + 136 ( r # 0 )

For a = 576 b = 136

576 = 136 × 4 + 32 ( r # 0 )

For a = 136 b = 32

136 = 32 × 4 + 8 ( r # 0 )

For a = 32 b = 8

32 = 8 × 4 + 0 ( r # 0 )

Therefore HCF [ 1288 and 576 ] = 8



Hope it will helps you ✌ ✌