An army cotninent 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 no of columns what is the maximum number of columns in which they can march
Answers
Answered by
4
by Euclid division algorithm
616=32x16+24
32=24x1+6
24=6x4+0
answer is 6
616=32x16+24
32=24x1+6
24=6x4+0
answer is 6
Answered by
16
This problem can be solved by EUCLID'S DIVISION LEMMA.
This can be solved by the following steps:
616 = 32 × 19 + 8
As the remainder 8 is not equal to 0, we apply the division lemma to 32 and 8
32 = 8 × 4 + 0
As the reminder is zero, we stop the procedure. At this stage, divisor is 8. So, HCF of 616 and 32 is 8.
That is, the maximum number of columns in which an army contingent of 616 members can march behind an army band of 32 members in a parade is 8.
This can be solved by the following steps:
616 = 32 × 19 + 8
As the remainder 8 is not equal to 0, we apply the division lemma to 32 and 8
32 = 8 × 4 + 0
As the reminder is zero, we stop the procedure. At this stage, divisor is 8. So, HCF of 616 and 32 is 8.
That is, the maximum number of columns in which an army contingent of 616 members can march behind an army band of 32 members in a parade is 8.
Similar questions