Question

an army contingent of 616 members is to March behind an army band of 32 members in a parade. the two groups are to March in the same numbers of columns. what is the maximum number of columns in which they can march?​

Answer 1

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

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

Answer 2

$\huge \underline \mathbb {SOLUTION:-}$

Given:

• Number of army contingent members = 616
• Number of army band members = 32

If the two groups have to march in the same column, we have to find out the highest common factor between the two groups. HCF(616, 32), gives the maximum number of columns in which they can march.

By Using Euclid’s algorithm to find their HCF, we get,

Since, 616>32, therefore,

616 = 32 × 19 + 8

Since, 8 ≠ 0, therefore, taking 32 as new divisor, we have,

32 = 8 × 4 + 0

• Now we have got remainder as 0, therefore, HCF (616, 32) = 8.

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