返回题库

AIME 2013 I · 第 15 题

AIME 2013 I — Problem 15

专题
Contest Math
难度
L4
来源
AIME

题目详情

Problem

Let NN be the number of ordered triples (A,B,C)(A,B,C) of integers satisfying the conditions (a) 0leA,(b)thereexistintegers0\\le A, (b) there exist integersa,,b,and, andc,andprime, and primepwherewhere0\le b, (c) pp divides AaA-a, BbB-b, and CcC-c, and (d) each ordered triple (A,B,C)(A,B,C) and each ordered triple (b,a,c)(b,a,c) form arithmetic sequences. Find NN.

解析

Solution

From condition (d), we have (A,B,C)=(BD,B,B+D)(A,B,C)=(B-D,B,B+D) and (b,a,c)=(ad,a,a+d)(b,a,c)=(a-d,a,a+d).

Now, we substitute these values in. Condition (c)\text{(c)} states that pBDap\mid B-D-a, pBa+dp | B-a+d, and pB+Dadp\mid B+D-a-d. We subtract the first two to get pdDp\mid-d-D, and we do the same for the last two to get p2dDp\mid 2d-D. We subtract these two to get p3dp\mid 3d. So p3p\mid 3 or pdp\mid d. The second case is clearly impossible, because that would make c=a+d>pc=a+d>p, violating condition (b)\text{(b)}. So we have p3p\mid 3, meaning p=3p=3. Condition (b)\text{(b)} implies that (b,a,c)=(0,1,2)(b,a,c)=(0,1,2) or (a,b,c)(1,0,2)(2,0,2) (D2 mod 3)(a,b,c)\in (1,0,2)\rightarrow (-2,0,2)\text{ }(D\equiv 2\text{ mod 3}).

Now we return to condition (c)\text{(c)}, which now implies that (A,B,C)(2,0,2)(mod3)(A,B,C)\equiv(-2,0,2)\pmod{3}. Now, we set B=3kB=3k for increasing positive integer values of kk. B=0B=0 yields no solutions. B=3B=3 gives (A,B,C)=(1,3,5)(A,B,C)=(1,3,5), giving us 11 solution. If B=6B=6, we get 22 solutions, (4,6,8)(4,6,8) and (1,6,11)(1,6,11). Proceeding in the manner, we see that if B=48B=48, we get 16 solutions. However, B=51B=51 still gives 1616 solutions because Cmax=2B1=101>100C_\text{max}=2B-1=101>100. Likewise, B=54B=54 gives 1515 solutions. This continues until B=96B=96 gives one solution. B=99B=99 gives no solution. Thus, N=1+2++16+16+15++1=216(17)2=1617=272N=1+2+\cdots+16+16+15+\cdots+1=2\cdot\frac{16(17)}{2}=16\cdot 17=\boxed{272}.

Solution 2

Let (A,B,C)(A, B, C) = (Bx,B,B+x)(B-x, B, B+x) and (b,a,c)=(ay,a,a+y)(b, a, c) = (a-y, a, a+y). Now the 3 differences would be

\label1Aa=Bxa\label2Bb=Ba+y\label3Cc=B+xay\begin{aligned} \label{1} &A-a = B-x-a \\ \label{2} &B - b = B-a+y \\ \label{3} &C - c = B+x-a-y \end{aligned} Adding equations (1)(1) and (3)(3) would give 2B2ay2B - 2a - y. Then doubling equation (2)(2) would give 2B2a+2y2B - 2a + 2y. The difference between them would be 3y3y. Since p{(1),(2),(3)}p|\{(1), (2), (3)\}, then p3yp|3y. Since pp is prime, p3p|3 or pyp|y. However, since p>yp > y, we must have p3p|3, which means p=3p=3.

If p=3p=3, the only possible values of (b,a,c)(b, a, c) are (0,1,2)(0, 1, 2). Plugging this into our differences, we get

Aa=Bx1(4)Bb=B(5)Cc=B+x2(6)\begin{aligned} &A-a = B-x-1 \hspace{4cm}(4)\\ &B - b = B \hspace{5.35cm}(5)\\ &C - c = B+x-2 \hspace{4cm}(6) \end{aligned} The difference between (4)(4) and (5)(5) is x+1x+1, which should be divisible by 3. So x2mod3x \equiv 2 \mod 3. Also note that since 3(5)3|(5), 3B3|B. Now we can try different values of xx and BB:

When x=2x=2, B=3,6,...,9632B=3, 6, ..., 96 \Rightarrow 32 triples.

When x=5x=5, B=6,9,...,9330B=6, 9, ..., 93\Rightarrow 30 triples..

... and so on until

When x=47x=47, B=48,512B=48, 51\Rightarrow 2 triple.

So the answer is 32+30++2=27232 + 30 + \cdots + 2 = \boxed{272}

~SoilMilk