Answer :

Suppose, both groups are arranged in 'n' columns, for completely filling each column,

The maximum no of columns in which they can march is the highest common factor of their number of members.

i.e. n = HCF(616, 32)

The maximum no of columns in which they can march is the highest common factor of their number of members.

i.e. n = HCF(616, 32)

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.

Rate this question :

How useful is this solution?

We strive to provide quality solutions. Please rate us to serve you better.

Try our Mini CourseMaster Important Topics in 7 DaysLearn from IITians, NITians, Doctors & Academic Expertsview all courses

Dedicated counsellor for each student

24X7 Doubt Resolution

Daily Report Card

Detailed Performance Evaluation

RELATED QUESTIONS :

Show that the squNCERT - Maths Exemplar

Show that the squNCERT - Maths Exemplar

Using Euclid’s diNCERT - Maths Exemplar

Show that one andRS Aggarwal - Mathematics

Write whether theNCERT - Maths Exemplar

One dividing a poRS Aggarwal - Mathematics

Show that the squNCERT - Maths Exemplar