1999 AIME 第 5 题

先试着解答 1999 AIME 第 5 题,然后核对你的答案与精心整理的解答,解答来自 LIVE by Po-Shen Loh。你也可以参加完整限时模拟考试、查看全部 1999 AIME 解答,或核对答案

所有题目均经美国数学协会(MAA)官方合法授权使用。

5.

对任意正整数 xx, 令 S(x)S(x)xx 的各位数字之和,令 T(x)T(x)S(x+2)S(x)|S(x + 2) - S(x)|。 例如,T(199)T(199) =S(201)S(199)= |S(201) - S(199)| =319= |3 - 19| =16= 16。 不超过 19991999T(x)T(x) 的不同取值有多少个?

For any positive integer x,x, let S(x)S(x) be the sum of the digits of x,x, and let T(x)T(x) be S(x+2)S(x).|S(x + 2) - S(x)|. For example, T(199)T(199) =S(201)S(199)= |S(201) - S(199)| =319= |3 - 19| =16.= 16. How many values T(x)T(x) do not exceed 1999?1999?

答案:223
知识点:数字等差数列分类讨论
难度评级:2400
解答:

如果 xx 的末位数字至多为 77,加 22 不会改变其他数字,所以 T(x)=2T(x) = 2。否则会发生进位。如果 xx 以数字 88 结尾,且它前面恰有 m0m \ge 0 个连续的九,那么 x+2x + 2 会把 a99m8\ldots a\underbrace{9 \cdots 9}_{m}8 变为 (a+1)00m0\ldots (a{+}1)\underbrace{0 \cdots 0}_{m}0,所以 S(x+2)S(x)=19m8S(x + 2) - S(x) = 1 - 9m - 8,从而 T(x)=9m+7T(x) = 9m + 7。如果 xx 恰以 m1m \ge 1 个连续的九结尾,那么 x+2x + 2 会把 a99m\ldots a\underbrace{9 \cdots 9}_{m} 变为 (a+1)00m11\ldots (a{+}1)\underbrace{0 \cdots 0}_{m - 1}1,所以 S(x+2)S(x)=29mS(x + 2) - S(x) = 2 - 9m,从而 T(x)=9m2T(x) = 9m - 2

两类进位情况给出的正好都是 7,16,25,7, 16, 25, \ldots,也就是 9j+79j + 7j0j \ge 0),且每个这样的值都能出现。因此 TT 的可能取值为 22 以及所有 9j+79j + 7。要求 9j+719999j + 7 \le 1999j221j \le 221,共有 222222 个值,再加上 T=2T = 2,总数为 223223

If the last digit of xx is at most 7,7, adding 22 changes no other digit, so T(x)=2.T(x) = 2. Otherwise there is carrying. If xx ends in the digit 88 preceded by exactly m0m \ge 0 nines, then x+2x + 2 replaces a99m8\ldots a\underbrace{9 \cdots 9}_{m}8 by (a+1)00m0,\ldots (a{+}1)\underbrace{0 \cdots 0}_{m}0, so S(x+2)S(x)=19m8S(x + 2) - S(x) = 1 - 9m - 8 and T(x)=9m+7.T(x) = 9m + 7. If xx ends in exactly m1m \ge 1 nines, then x+2x + 2 replaces a99m\ldots a\underbrace{9 \cdots 9}_{m} by (a+1)00m11,\ldots (a{+}1)\underbrace{0 \cdots 0}_{m - 1}1, so S(x+2)S(x)=29mS(x + 2) - S(x) = 2 - 9m and T(x)=9m2.T(x) = 9m - 2.

Both carrying families give exactly the values 7,16,25,,7, 16, 25, \ldots, that is, 9j+79j + 7 for j0,j \ge 0, and every such value occurs. So the possible values of TT are 22 together with all 9j+7.9j + 7. Requiring 9j+719999j + 7 \le 1999 gives j221,j \le 221, which is 222222 values, and T=2T = 2 adds one more, for a total of 223.223.

← 第 4 题#4
完整试卷

其他年份的第 5 题