
Answer :
HCF (616, 32) will give the maximum number of columns in which they can march.
We can use Euclid’s algorithm to find the HCF.
616 = 32 x 19 + 8
32 = 8 x 4 + 0
The HCF (616, 32) is 8.
Therefore, they can march in 8 columns each
Next NCERT Solution Class 10th Math




