Question

An army contingent of 616 members is to March behind an army band of 32 members in parade the two group are to March in same number of columns in which they can march​ ?​

Answer 1

Answer:

Answer:

To get the maximum number column here we always find HCF and for minimum number we find LCM

So can use Euclid’s algorithm to find the HCF.

Here 616> 32 so always divide greater number with smaller one

When we divide 616 by 32 we get quotient 19 and remainder 8

So we can write it as

616 = 32 x 19 + 8

Now divide 32 by 8 we get quotient 4 and no remainder

So we can write it as

32 = 8 x 4 + 0

As there are no remainder so our HCF will 8

Answer 2

$\huge \fbox \red{Solution:}$

It is given that an army contingent of 616 members is to march behind an army band of 32

members in a parade. Also, the two groups are to march in the same number of columns.

Thus, we need to find the maximum number of columns in which they can march.

This is done by simply finding the HCF of the given two numbers.

Therefore, the maximum number of columns = H.C.F of 616 and 32.

$\fbox \blue{By applying Euclid’s division lemma}$

616 = 32 x 19 + 8

32 = 8 x 4 + 0.

So, H.C.F. = 8

$\fbox \blue{∴ The maximum number of columns in which they can march is 8.}$

$\bold\orange{Thanks}$