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 $1$. From this point, count $2$ points in the clockwise direction and label this point $2$. From the point labeled $2$, count $3$ points in the clockwise direction and label this point $3$. (See figure.) Continue this process until the labels $1,2,3\dots,1993\,$ 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 $1993$?

AIME 1993 Problem 9.png

Solution

The label $1993$ will occur on the $\frac12(1993)(1994) \pmod{2000}$th point around the circle. (Starting from 1) A number $n$ will only occupy the same point on the circle if $\frac12(n)(n + 1)\equiv \frac12(1993)(1994) \pmod{2000}$.

Simplifying this expression, we see that $(1993)(1994) - (n)(n + 1) = (1993 - n)(1994 + n)\equiv 0\pmod{2000}$. Therefore, one of $1993 - n$ or $1994 + n$ is odd, and each of them must be a multiple of $125$ or $16$.

For $1993 - n$ to be a multiple of $125$ and $1994 + n$ to be a multiple of $16$, $n \equiv 118 \pmod {125}$ and $n\equiv 6 \pmod {16}$. The smallest $n$ for this case is $118$.

In order for $1993 - n$ to be a multiple of $16$ and $1994 + n$ to be a multiple of $125$, $n\equiv 9\pmod{16}$ and $n\equiv 6\pmod{125}$. The smallest $n$ for this case is larger than $118$, so $\boxed{118}$ is our answer.

Note: One can just substitute $1993\equiv-7\pmod{2000}$ and $1994\equiv-6\pmod{2000}$ to simplify calculations.

See also

1993 AIME (ProblemsAnswer KeyResources)
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. AMC logo.png