There are 15 kids at the apple orchard, who picked a total of 100 apples. Is it possible that no 2 of them picked the same number of apples?
Note: They each picked a non-negative integer number of apples.
This section requires Javascript.
You are seeing this because something didn't load right. We suggest you, (a) try
refreshing the page, (b) enabling javascript if it is disabled on your browser and,
finally, (c)
loading the
non-javascript version of this page
. We're sorry about the hassle.
The first and foremost possibility we have to check is what would happen if one child takes 1 apple, the next one takes two apples, the next one takes 3 apples the next ine takes 4 apples an so on.
We find that
n
=
1
∑
1
3
n
=
2
1
3
×
1
4
=
9
1
.
Then
n
=
1
∑
1
4
n
=
2
1
4
×
1
5
=
1
0
5
. But there are only 100 apples, so the 14th child cannot take 14 apples. According to question, a child takes a non-negative integer number of apples. So, a child can take 0 apples. So, the only child left is the 15th one. But now only 9 apples are left. So, the 15th child would have to take 9 apples to satisfy the condition of the question. But that would be the same number of apples as taken by the 9th child (i.e. 9 apples). So, there is no possibility of atleast two children taking the same number of apples.
Applying the Pigeonhole principle, there is atleast [ 1 0 0 / 1 5 ] kids who has two or more apples. Done.
Close, but not quite. That's not a correct application of Pigeonhole Principle.
In the general statement, all that you know is "there is at least 1 hole with h o l e s p i g e o n s pigeons". It could be that the particular hole contains all of the pigeons, which is why we only know that "there is at least 1".
Problem Loading...
Note Loading...
Set Loading...
The least number of apples they can take is 0 + 1 + 2 + 3 + . . . + 1 4 = 2 1 4 × 1 5 = 1 0 5 > 1 0 0 , so it is not possible.