2017 AMC 12A Problem 12

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

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

12.

There are 1010 horses, named Horse 1,1, Horse 2,2, …,\ldots, Horse 10.10. They get their names from how many minutes it takes them to run one lap around a circular race track: Horse kk runs one lap in exactly kk minutes. At time 00 all the horses are together at the starting point on the track. The horses start running in the same direction, and they keep running around the circular track at their constant speeds. The least time S>0,S\gt0, in minutes, at which all 1010 horses will again simultaneously be at the starting point is S=2520.S=2520. Let T>0T\gt0 be the least time, in minutes, such that at least 55 of the horses are again at the starting point. What is the sum of the digits of T?T?
22
33
44
55
66
Answer: B
Concepts:divisibilityleast common multiple
Small hint:
A horse is at the start exactly when its name divides the elapsed time
Big hint:
Find the least time divisible by at least five numbers from 11 through 1010
Solution:
Horse kk is back at the starting point after tt minutes exactly when tt is divisible by kk. Thus we need the least positive tt that is divisible by at least five of the integers 1,2,…,101,2,\ldots,10.
Checking upward, no number below 1212 has five divisors from this list: for example, 66 has 1,2,3,61,2,3,6, 88 has 1,2,4,81,2,4,8, 99 has 1,3,91,3,9, and 1010 has 1,2,5,101,2,5,10.
The number 1212 is divisible by 1,2,3,4,1,2,3,4, and 66, so the least possible time is T=12T=12. The sum of its digits is 1+2=31+2=3.
Thus, B 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.Terms of UsePrivacy PolicyCOPPA Privacy Policy