I am trying to understand an already solved problem which makes use of the pigeonhole principle
There are $271$ students in an exam which consists of $3$ random, non-repeating questions out of a pool of $10$, with no particular order. (this gives $10·9·8=720$ possible exams for $721$ participants)
- Show that at least $17$ students will have an exam with the same two first questions
The solution proceeds as follows:
There are $10·\frac{9}{2} = 45$ possible combinations of the first two questions
Then, as $270=45·16$, there are at least $16+1=17$ students with the same two first questions
- Show that at least $9$ students will have an exam with the same first and third questions
This other solution proceeds as follows:
There are $10·9 = 80$ possible combinations of the first and third questions
Then, as $720=90*8$, there are at least $8+1=9$ students with the same first and third >questions
I see that the pattern is showing that there are not "enough" exams with these combinations for the required number of students, but I do not understand the reasoning behind obtaining the possible combinations ($45$ and $80$).
Any help is appreciated! (I think that my problem is with Statistics!)