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

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.

Was this answer helpful?

  
   

0 (0)

Upvote (0)

Choose An Option That Best Describes Your Problem

Thank you. Your Feedback will Help us Serve you better.

Leave a Comment

Your Mobile number and Email id will not be published. Required fields are marked *

*

*

BOOK

Free Class

Ask
Question