2006 AIME I 第 3 题

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

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

3.

求最小的正整数,使得删去它最左边的数字后,所得整数是原整数的 129\frac{1}{29}

Find the least positive integer such that when its leftmost digit is deleted, the resulting integer is 129\frac{1}{29} of the original integer.

答案:725
知识点:数字位值整除性
难度评级:2020
解答:

dd 为最左边的数字,nn 为删去它后剩下的整数,则原整数为 d10p+nd \cdot 10^p + n,其中 pp 为某个正整数。条件给出 d10p+n=29nd \cdot 10^p + n = 29n, 所以 d10p=28nd \cdot 10^p = 28n

因为 728n7 \mid 28n710p7 \nmid 10^p,数字 dd 必须是 77 的倍数,所以 d=7d = 7。于是 10p=4n10^p = 4n,得 n=2510p2n = 25 \cdot 10^{p-2},这要求 p2p \ge 2。最小情形为 p=2p = 2n=25n = 25

最小的这样的整数是 725725, 且确实有 725=2925725 = 29 \cdot 25

Let dd be the leftmost digit and nn the integer that remains after deleting it, so the original integer is d10p+nd \cdot 10^p + n for some positive integer p.p. The condition says d10p+n=29n,d \cdot 10^p + n = 29n, so d10p=28n.d \cdot 10^p = 28n.

Since 728n7 \mid 28n but 710p,7 \nmid 10^p, the digit dd must be a multiple of 7,7, so d=7.d = 7. Then 10p=4n,10^p = 4n, giving n=2510p2,n = 25 \cdot 10^{p-2}, which requires p2.p \ge 2. The smallest case is p=2,p = 2, n=25.n = 25.

The least such integer is 725,725, and indeed 725=2925.725 = 29 \cdot 25.

← 第 2 题#2
完整试卷

其他年份的第 3 题