Question

use euclid division algorithm to find the hcf of 1264 and 82

Answer 1

Hey!!

We have 1264 and 82

By Euclid's Division algorithm

a = bq + r where 0 < r < b

For a = 1264 b = 82

1264 = 82 × 15 + 34 ( r # 0 )

For a = 82 b = 34


82 = 34 × 2 + 18 ( r # 0 )

For a = 34 b = 18


34 = 18 × 1 + 16 ( r # 0 )

For a = 18 b = 16

18 = 16 × 1 + 2 ( r # 0 )


For a = 16 b = 2


16 = 2 × 8 + 0 ( r = 0 )



Therefore HCF [ 1264 and 82 ] = 2



Hope it will helps you✌

Answer 2

We Have 1264 And 82

By Euclid's Division Algorithm

A= bq + r where 0 < r <b

For A= 1264 b= 82

1264= 82* 15 + 34 (r # 0)

For A= 82 b= 34

82= 34*2 + 18

34= 18 *1 + 16 (r # 0)

For A = 18 b = 16

18= 16*1 + 2 (r # 0)

For A = 16 b= 2

16 = 2*8 + 0 (r = 0)

Therefore HCF [ 1264 and 82] = 2.