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?

MCQExplainer

Solutions: Maximum number of columns = HCF of (616, 32) For finding the HCF we should apply Euclid’s division algorithm Given numbers are 616 and 32 On applying Euclid’s division algorithm, we have 616 = 32 x 19 + 8 Since the remainder 8 ≠ 0, so again we apply Euclid’s division algorithm to 32 and 8Read more

See lessSolutions:Maximum number of columns = HCF of (616, 32)

For finding the HCF we should apply Euclid’s division algorithm

Given numbers are 616 and 32

On applying Euclid’s division algorithm, we have

616 = 32 x 19 + 8

Since the remainder 8 ≠ 0, so again we apply Euclid’s division algorithm to 32 and 8, to get

32 = 8 x 4 + 0

The remainder has now become zero, so we stop,

∵ At the last stage, the divisor is 8

∴ The HCF of 616 and 32 is 8.

Therefore, the maximum number of columns in which an army contingent of 616 members can march behind an army band of 32 members in a parade is 8.

At the last stage, the divisor is 8 ∴ The HCF of 616 and 32 is 8. Therefore, the maximum number of columns in which an army contingent of 616 members can march behind an army band of 32 members in a parade is 8.

At the last stage, the divisor is 8

∴ The HCF of 616 and 32 is 8.

Therefore, the maximum number of columns in which an army contingent of 616 members can march behind an army band of 32 members in a parade is 8.

See less