Premium Online Home Tutors
3 Tutor System
Starting just at 265/hour
Answer :
We have to find the HCF (616, 32) to find the maximum number of columns in which they can march.
To find the HCF, we can use Euclid’s algorithm.
616 = 32 × 19 + 8
32 = 8 × 4 + 0
The HCF (616, 32) is 8.
Therefore, they can march in 8 columns each.