The two groups are to march in the same number of columns. What is the maximum number of columns in which they can march?

Report
Question

By using,  Euclid’s division algorithm
616 = 32×19+8     
Remainder ≠ 0
So, again Applying Euclid’s division algorithm
32 = 8×4+0
HCF of (616, 32) is 8.
So ,
They can march in 8 columns each.

solved 5
wordpress 4 mins ago 5 Answer 70 views +22

Leave a reply

 Prev question

Next question