Given,
Number of army contingent members=616
Number of army band members = 32
When we find the HCF(616,32) then we get maximum number of columns in which they can march.
We use Euclid’s algorithm to find their HCF
Since, , therefore,
Since, 8 ≠ 0, therefore, taking 32 as new divisor, we have,
we have got remainder as 0,
therefore, HCF (616, 32) = 8.
maximum number of columns in which they march is 8.