2015 AMC 8 Problem 22

Attempt Problem 22 of the 2015 AMC 8 below, then check your answer against the video solution and professionally curated solution from LIVE by Po-Shen Loh. You can also try the full timed exam, view all 2015 AMC 8 solutions, or check the answer key.

All problems are used with official legal permission of the Mathematical Association of America (MAA).

22.

On June 1,1, a group of students is standing in rows, with 1515 students in each row. On June 2,2, the same group is standing with all of the students in one long row. On June 3,3, the same group is standing with just one student in each row. On June 4,4, the same group is standing with 66 students in each row. This process continues through June 1212 with a different number of students per row each day. However, on June 13,13, they cannot find a new way of organizing the students. What is the smallest possible number of students in the group?
21 21
30 30
60 60
90 90
1080 1080
Answer: C
Concepts:factor countingleast common multiplecasework
Small hint:
The different row sizes are the divisors of the group size.
Big hint:
You need the smallest multiple of both 66 and 1515 with exactly 1212 divisors.
Video solution:
Solution video thumbnail
Play video

Click to load, then click again to play

Written solution:
The possible numbers of students per row are exactly the positive divisors of the total number of students. Since June 11 through June 1212 give different arrangements and June 1313 gives no new one, the total number of students must have exactly 1212 positive divisors.
The number must be divisible by both 1515 and 6,6, hence by lcm⁡(15,6)=30=2⋅3⋅5.\operatorname{lcm}(15,6)=30=2\cdot3\cdot5. This number has only 88 divisors.
The smallest multiple of 3030 with 1212 divisors is 60=22⋅3⋅5,60=2^2\cdot3\cdot5, which has (2+1)(1+1)(1+1)=12(2+1)(1+1)(1+1)=12 divisors.
Thus, C is the correct answer.
LIVE by Po-Shen Loh
Programs

LIVE Classes

Self-Paced Classes

Stars

Scholarship

About Us

Who Is Po-Shen Loh?

Email Contact

Newsletter

Jobs

Become a Star

For a more Thought Full world.

© 2026 Expii, Inc.