## Euclid’s Algorithm to Find HCF

**EXERCISE**: Find the HCF of 135 and 225 by using Euclid’s division algorithm.

**SELF PRACTICE** Use Euclid’s division algorithm to find the HCF of 270 and 450.

**EXERCISE**: Use Euclid’s division algorithm to find the HCF of:

i) 196 and 38220.

ii) 867 and 255.

**SELF PRACTICE**: Use Euclid’s division algorithm to find the HCF of:

i) 98 and 19110.

ii) 1734 and 510.

**EXERCISE**: An army contingent of 616 members is to march behind an army band of 32 members in a parade. The two groups are to march in the same number of columns. What is the maximum number of columns in which they can march?

**SELF PRACTICE**: A naval contingent of 1232 officers march behind an army band of 64 officers in the same number of columns. What is the minimum number of rows formed by the naval contingent?

## 0 comments