Does anyone have a better way of attacking this problem. I'm not really comprehending the book's explanation:
A school administrator will assign each student in a group of n students to one of m classrooms. If 3<m<13<n, is it possible to assign each of the n students to one of the m classroom has the same number of students assigned to it?
1.) It is possible to assign each of 3n students to one of m classrooms so that each classroom has the same number of students assigned to it.
2.)It is possible to assign each of 13n students to one of m classrooms so that each 13n students to one of m classrooms so that each classroom has the same number of students assigned to it.
A school administrator will assign each student in a group of n students to one of m classrooms. If 3<m<13<n, is it possible to assign each of the n students to one of the m classroom has the same number of students assigned to it?
1.) It is possible to assign each of 3n students to one of m classrooms so that each classroom has the same number of students assigned to it.
2.)It is possible to assign each of 13n students to one of m classrooms so that each 13n students to one of m classrooms so that each classroom has the same number of students assigned to it.

















