Question

Word Problems

1 A contingent of 428 soldiers was marching in a parade. The leader of this contingent was leading the team in the front. The remaining soldiers formed a perfect rectangle behind him. If the number of soldiers in each row behind him was less than 12, find the maximum number of soldiers in each row. Also find the number of rows in that rectangular formation.

2 Suresh had 72 counters with him. He arranged them in the form of a rectangle. He found that he could arrange 1 counter each in a row and get 72 rows, 2 counters each in a row and get 36 rows, and 3 cach in a row to get 24 rows. What other rectangular formations are possible?

3 Alkg packet of toffee contains 85 toffees. Janu bought 8 such packets. She emptied all the 8 packets of toffees into a big container. Her five friends who helped her in this work took 7 toffees each. They packaged the remaining toffees equally into three boxes. How many toffees were packed in each box?​

Answer 1

Answer:

Given:

An army contingent of 612 members is to march behind an army band of 48 members.

Here, HCF of 612 and 48 will give the maximum number of columns in which the two groups can march.

So, using Euclid's division algorithm

612=48×12+36

⇒48=36×1+12

→36=12×3+0

∴HCF(612,48)=12

Hence, the maximum no of columns in which they can march is 12

Answer 2

Answer:

f FM mkkhgfffjbfssfjimk