Question

Find hcf using Euclid's division algorithm 125 and 3725

Answer 1

125 and 3725

3725>125

By using Euclid's division lemma to 125 and 3725 we get

• 3725=125 × 29 + 100

Since the reminder 100≠0 we apply Euclid's division lemma on the Divisor 125 and remainder 100, to get

• 125=100 × 1 + 25

Since the reminder 25≠0 we apply Euclid's division lemma on the Divisor 100 and remainder 25, to get

• 100=25 × 4 + 0

Since remainder =0

★Therefore HCF of 125 and 3725 is 25.