Difference between revisions of "2017 AMC 10A Problems/Problem 16"
(→Solution) |
|||
Line 5: | Line 5: | ||
==Solution== | ==Solution== | ||
+ | Stratergy: find the LCM | ||
+ | |||
+ | We know that Horses <math>1</math>, <math>2</math>, <math>3</math>, <math>4</math>, and <math>6</math> will all meet at the starting line in 12 minutes. Therefore, the answer is: <br> | ||
+ | <math>1 + 2 = \boxed{\textbf{(B)}\ 3}</math> | ||
==See Also== | ==See Also== | ||
{{AMC10 box|year=2017|ab=A|num-b=15|num-a=17}} | {{AMC10 box|year=2017|ab=A|num-b=15|num-a=17}} | ||
{{MAA Notice}} | {{MAA Notice}} |
Revision as of 18:47, 8 February 2017
Problem
There are horses, named Horse , Horse , . . . , Horse . They get their names from how many minutes it takes them to run one lap around a circular race track: Horse runs one lap in exactly minutes. At time 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 , in minutes, at which all horses will again simultaneously be at the starting point is . Let be the least time, in minutes, such that at least 5 of the horses are again at the starting point. What is the sum of the digits of
Solution
Stratergy: find the LCM
We know that Horses , , , , and will all meet at the starting line in 12 minutes. Therefore, the answer is:
See Also
2017 AMC 10A (Problems • Answer Key • Resources) | ||
Preceded by Problem 15 |
Followed by Problem 17 | |
1 • 2 • 3 • 4 • 5 • 6 • 7 • 8 • 9 • 10 • 11 • 12 • 13 • 14 • 15 • 16 • 17 • 18 • 19 • 20 • 21 • 22 • 23 • 24 • 25 | ||
All AMC 10 Problems and Solutions |
The problems on this page are copyrighted by the Mathematical Association of America's American Mathematics Competitions.