2009 AIME I 第 7 题

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

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

7.

数列 (an)(a_n) 满足 a1=1a_1 = 1,且对 n1n \ge 15(an+1an)1=1n+235^{(a_{n+1} - a_n)} - 1 = \frac{1}{n + \frac{2}{3}}。令 kk 为大于 11 的最小整数,使得 aka_k 是整数。求 kk

The sequence (an)(a_n) satisfies a1=1a_1 = 1 and 5(an+1an)1=1n+235^{(a_{n+1} - a_n)} - 1 = \frac{1}{n + \frac{2}{3}} for n1.n \ge 1. Let kk be the least integer greater than 11 for which aka_k is an integer. Find k.k.

答案:41
知识点:裂项相消对数模运算
难度评级:2450
解答:

该关系给出 5an+1an=1+33n+2=3n+53n+25^{a_{n+1} - a_n} = 1 + \frac{3}{3n + 2} = \frac{3n+5}{3n+2}。将 n=1,2,,k1n = 1, 2, \ldots, k - 1 的这些等式相乘,发生望远镜相消: 5aka1=3k+25,5^{a_k - a_1} = \frac{3k + 2}{5}, 所以 ak=1+log53k+25=log5(3k+2). \begin{aligned} a_k &= 1 + \log_5 \frac{3k+2}{5} \\ &= \log_5 (3k + 2). \end{aligned}

因此 aka_k 为整数当且仅当 3k+23k + 255 的幂。由于 5j2j(mod3)5^j \equiv 2^j \pmod 3, 只有奇数指数 jj 才能给出形如 3k+23k + 2 的数。 幂 51=55^1 = 5 给出 k=1k = 1 被排除;下一个 53=125=341+25^3 = 125 = 3 \cdot 41 + 2, 给出 k=41k = 41

The relation says 5an+1an=1+33n+2=3n+53n+2.5^{a_{n+1} - a_n} = 1 + \frac{3}{3n + 2} = \frac{3n+5}{3n+2}. Multiplying these equations for n=1,2,,k1n = 1, 2, \ldots, k - 1 telescopes: 5aka1=3k+25,5^{a_k - a_1} = \frac{3k + 2}{5}, so ak=1+log53k+25=log5(3k+2). \begin{aligned} a_k &= 1 + \log_5 \frac{3k+2}{5} \\ &= \log_5 (3k + 2). \end{aligned}

Thus aka_k is an integer exactly when 3k+23k + 2 is a power of 5.5. Since 5j2j(mod3),5^j \equiv 2^j \pmod 3, only odd exponents jj give numbers of the form 3k+2.3k + 2. The power 51=55^1 = 5 gives k=1,k = 1, which is excluded, and the next, 53=125=341+2,5^3 = 125 = 3 \cdot 41 + 2, gives k=41.k = 41.

← 第 6 题#6
完整试卷

其他年份的第 7 题