Question

Use eucluid,s division algoritm to find the HCF of 75,243

Answer 1

Euclid's Division Algorithm :

a = bq+r (where r > b )

To Find : The Highest Common Factor of 75 and 243

Solution :

By using the Euclid's Division Algorithm , finding the highest common factor of 75 and 243 :

243 = 75 × 3 + 18

75 = 18 × 4 + 3

18 = 3 × 6 + 0

The required Highest Common Factor is 3.