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 classrooms so that each 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 classroom has the same number of students assigned to it.
This topic has been discussed before ........but i have a querry
The question says that m has to be a factor of n. In statement (2) if the number of students are 13n , then for m (classrooms) to be a factor for all possible values of 13n(students) , m has to be equal to 13. The problem states 3 < m < 13 <n. So if the number of students are 13*17 ,13 & 17 both are prime numbers then it is not divisible by m (because the number of classrooms always have to be less than 13)
Can somebody answer my querry?
(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 classroom has the same number of students assigned to it.
This topic has been discussed before ........but i have a querry
The question says that m has to be a factor of n. In statement (2) if the number of students are 13n , then for m (classrooms) to be a factor for all possible values of 13n(students) , m has to be equal to 13. The problem states 3 < m < 13 <n. So if the number of students are 13*17 ,13 & 17 both are prime numbers then it is not divisible by m (because the number of classrooms always have to be less than 13)
Can somebody answer my querry?
