If there are 6 sections of Discrete Math with the total enro

If there are 6 sections of Discrete Math, with the total enrolment of 199 students, what is the smallest possible number of students in the section with the largest enrollment?

Solution

by the pigeon hole principle , there is a section with atleast ceil(199/6) students

that is

34 students.

So this is the smallest number of students in the largest group