Data Sufficiency

Hello all,
This is from OG Review 12ed -- DS -- Problem 128. (Page 284)

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.

I looked at the answer but I couldn't understand it enough to be able to solve it myself the next time I looked at something like this. Can someone please help in solving/simplifying it so that I can get the "concept" to be able to do it myself?

Thank you.

uhsa

try this link
https://www.beatthegmat.com/a-school-adm ... 42237.html

Thanks Clock60. I didn't realize someone had already posted the problem. The answers were confusing as well, but luckily the last answer had the solution attached and that helped. It makes sense now. i guess if I keep practicing then I will get it without any doubt.

Thanks again

uhsa