返回题库

AIME 1993 · 第 9 题

AIME 1993 — Problem 9

专题
Contest Math
难度
L4
来源
AIME

题目详情

Problem

Two thousand points are given on a circle. Label one of the points 11. From this point, count 22 points in the clockwise direction and label this point 22. From the point labeled 22, count 33 points in the clockwise direction and label this point 33. (See figure.) Continue this process until the labels 1,2,3,19931,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 19931993?

AIME diagram

解析

Solution

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

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

For 1993n1993 - n to be a multiple of 125125 and 1994+n1994 + n to be a multiple of 1616, n118(mod125)n \equiv 118 \pmod {125} and n6(mod16)n\equiv 6 \pmod {16}. The smallest nn for this case is 118118.

In order for 1993n1993 - n to be a multiple of 1616 and 1994+n1994 + n to be a multiple of 125125, n9(mod16)n\equiv 9\pmod{16} and n6(mod125)n\equiv 6\pmod{125}. The smallest nn for this case is larger than 118118, so 118\boxed{118} is our answer.

Note: One can just substitute 19937(mod2000)1993\equiv-7\pmod{2000} and 19946(mod2000)1994\equiv-6\pmod{2000} to simplify calculations.

Solution 2

Two labels aa and bb occur on the same point if  a(a+1)/2 b(b+1)/2(mod2000)\ a(a+1)/2\equiv \ b(b+1)/2\pmod{2000}. If we assume the final answer be nn, then we have 12(n)(n+1)12(1993)(1994)(mod2000)\frac12(n)(n + 1)\equiv \frac12(1993)(1994) \pmod{2000}.

Multiply 22 on both side we have (1993)(1994)(n)(n+1)=(1993n)(1994+n)0(mod4000)(1993)(1994) - (n)(n + 1) = (1993 - n)(1994 + n)\equiv 0\pmod{4000}. As they have different parities, the even one must be divisible by 3232. As (1993n)+(1994+n)2(mod5)(1993 - n)+(1994 + n)\equiv 2\pmod{5}, one of them is divisible by 55, which indicates it's divisible by 125125.

Which leads to four different cases: 1993n0(mod4000)1993-n\equiv 0\pmod{4000} ; 1994+n0(mod4000)1994+n\equiv 0\pmod{4000} ; 1993n0(mod32)1993-n\equiv 0\pmod{32} and 1994+n0(mod125)1994+n\equiv 0\pmod{125} ; 1993n0(mod125)1993-n\equiv 0\pmod{125} and 1994+n0(mod32)1994+n\equiv 0\pmod{32}. Which leads to n1993,2006,3881n\equiv 1993,2006,3881 and 118(mod4000)118\pmod{4000} respectively, and only n=118n=118 satisfied.Therefore answer is 118\boxed{118}.(by ZJY)