Answer:

Step-by-step explanation:

The maximum number of columns in which they can march = HCF (32, 616)

So can use Euclid’s algorithm to find the HCF

Since 616 > 32, applying Euclid’s Division Algorithm we have

616 = 32 x 19 + 8

Since remainder ≠ 0

we again apply Euclid’s Division Algorithm

Since 32 > 8

32 = 8 × 4 + 0

Since remainder = 0 we conclude, 8 is the HCF of 616 and 32.

The maximum number of columns in which they can march is 8.

Answer

The maximum number of columns in which they can march is 8.

• HCF (616,32) = maximum number of columns in which they can march.

• H.C.F. of 616 and 32 is 8.

• Therefore, 8 is the maximum number of columns in which they can march.