Question

find the hcf by euclids division algorithm
1- 256,352
2-450,500,625

Answer 1

1-32 2-50 Please likevit

Answer 2

Hi friend, Here is the required answer:-

•Using Euclid's Division Algorithm,

Step I :- 352= 256×1+ 96
Step II :- 256= 96×2 + 64
Step III :- 96= 64×1+ 32
Step IV:- 64= 32×2+ 0

So HCF = 32.

• 450 = 5×2×3×3×5
500= 5×5×5×2×2
625= 5×5×5×5

So HCF= 5×5= 25.

Since Euclid's division Algorithm can only be used for finding the HCF of two numbers, so I used prime factorisation method to find HCF in second part.

Hope this helps you...