1.

You have six boxes numbered 1, 2, 3, 4, 5 and 6 respectively. Your friend has distributed n balls among these boxes. What is the smallest value of n for which you can guarantee that there is at least one box that contains at least as many balls as the square on the number written on it?

Answer» ONG>Answer:

(B) The NUMBER of ways in which 1 GREEN ball can be put

=

6

. The number of ways in which two green BALLS can be put such that the boxes are consecutive

= 5

(i.e.,(1,2),(2,3),(3,4),(4,5),(5,6))

Similarly, the number of ways in which THREE green balls can be put

=

4(i.e.(1,2,3),(2,3,4),(3,4,5),(4,5,6))

⋯⋯⋯⋯⋯

and so on.

∴

Total number of ways of doing this

=

6+

5+

4+

3+

2+

1=

21


Discussion

No Comment Found

Related InterviewSolutions