Difference between revisions of "1993 AIME Problems/Problem 9"
(a bit lazy right now .. solution by 4everwise) |
|||
(One intermediate revision by one other user not shown) | |||
Line 12: | Line 12: | ||
In order for <math>1993 - n</math> to be a multiple of <math>16</math> and <math>1994 + n</math> to be a multiple of <math>125</math>, <math>n\equiv 9\pmod{16}</math> and <math>n\equiv 6\pmod{125}</math>. The smallest <math>n</math> for this case is larger than <math>118</math>, so <math>\boxed{118}</math> is our answer. | In order for <math>1993 - n</math> to be a multiple of <math>16</math> and <math>1994 + n</math> to be a multiple of <math>125</math>, <math>n\equiv 9\pmod{16}</math> and <math>n\equiv 6\pmod{125}</math>. The smallest <math>n</math> for this case is larger than <math>118</math>, so <math>\boxed{118}</math> is our answer. | ||
+ | |||
+ | '''Note:''' One can just substitute <math>1993\equiv-7\pmod{2000}</math> and <math>1994\equiv-6\pmod{2000}</math> to simplify calculations. | ||
== See also == | == See also == | ||
Line 17: | Line 19: | ||
[[Category:Intermediate Number Theory Problems]] | [[Category:Intermediate Number Theory Problems]] | ||
+ | {{MAA Notice}} |
Revision as of 19:26, 4 July 2013
Problem
Two thousand points are given on a circle. Label one of the points . From this point, count points in the clockwise direction and label this point . From the point labeled , count points in the clockwise direction and label this point . (See figure.) Continue this process until the labels are all used. Some of the points on the circle will have more than one label and some points will not have a label. What is the smallest integer that labels the same point as ?
Solution
The label will occur on the th point around the circle. (Starting from 1) A number will only occupy the same point on the circle if .
Simplifying this expression, we see that . Therefore, one of or is odd, and each of them must be a multiple of or .
For to be a multiple of and to be a multiple of , and . The smallest for this case is .
In order for to be a multiple of and to be a multiple of , and . The smallest for this case is larger than , so is our answer.
Note: One can just substitute and to simplify calculations.
See also
1993 AIME (Problems • Answer Key • Resources) | ||
Preceded by Problem 8 |
Followed by Problem 10 | |
1 • 2 • 3 • 4 • 5 • 6 • 7 • 8 • 9 • 10 • 11 • 12 • 13 • 14 • 15 | ||
All AIME Problems and Solutions |
The problems on this page are copyrighted by the Mathematical Association of America's American Mathematics Competitions.