Question

Some sweets are to distributed among 16,40 and 70 boys. Find the minimum number of sweets to distribute so that no sweet is left.

Answer 1

Answer:

560

Minimum no. of sweets = 560.

Step-by-step explanation:

The minimum number of sweets = LCM of 16, 40, 70.

16 = 2 *2 *2 *2

40 = 2 *2 *2 *5

70 = 2 *5 *7

So,

Required LCM = 2 *2 *2 *2 * 5 *7 = 560.

Minimum no. of sweets = 560.

Answer 2

Answer:

concept - We will use LCM  for finding the answer.

given - Number's of boys are 16, 40, and 70.

To find - Minimum number of sweets to distribute so that no sweet is left.

Step-by-step explanation:

We will try to find the lcm which is Least Common Multiple .

It is given that their are 16 , 40 and 70 boys

So LCM of respective boys are

Prime factors of 16 = 2 * 2 * 2 * 2

Prime factors of 40 = 2 * 2 * 2 * 5

Prime factors of 70 = 2 * 5 * 7

Using all prime numbers found as often as each occurs most often we get = 2 * 2 * 2* 2 * 5 * 7  = 560

Hence the minimum number to be distributed is 560

#SPJ2