[Math] Generalized Pigeonhole Principle

combinatoricspigeonhole-principle

Can somebody explain this to me? I am very confused.

I have a question that says
"What is the minimum number of students required in a discrete mathematics class to be sure that at least six will receive the same grade, if there are five possible grades, A, B, C, D, and F?"

and the solution is:

The minimum number of students needed to ensure that at least six students receive the same grade is the smallest integer N such that [N/5] = 6. The smallest such integer is N = 5* 5 + 1 = 26. If you have only 25 students, it is possible for there to be five who have received each grade so that no six students have received the same grade. Thus, 26 is the minimum number of students needed to ensure that at least six students will receive the same grade. The bolded part is the part that confuses me the most. Unless I haven't understood math in the past 20 years, N/5 = 6 would mean that N would have to be 30. So how exactly am I supposed to approach this question to understand what it is I'm trying to understand?

Best Answer

When there are 25 people, clearly the required condition is not met as it is possible for 5 groups of 5 people each to have gotten each of the different grades. (this is the only case with 25 people when no 6 people have got a common grade)

When you have one person extra, irrespective of his grade, there will be a grade now that is repeated 6 times. Hence, the minimum number of people is is 26.