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?
Given integers are 32 and 616.
Clearly 616 > 32. Therefore, applying Euclid’s division lemma to 616 and 32, we get![]()
Since, the remainder 8 ≠ 0, we apply the division lemma, to get![]()
The remainder has now become zero, so our procedure stops. Since the divisor at this stage is 8.
Therefore, the maximum number of columns in which both 616 members (army contingent) and 32 members (army band) can march is 8.



