2003 AIME I 第 14 题

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

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

14.

分数 mn\frac{m}{n} 中,mmnn 是互质正整数且 m<nm \lt n;它的十进制表示中依次连续出现数字 225511。求满足条件的最小 nn

The decimal representation of mn,\frac{m}{n}, where mm and nn are relatively prime positive integers and m<n,m \lt n, contains the digits 2,2, 5,5, and 11 consecutively, and in that order. Find the smallest value of nn for which this is possible.

答案:127
知识点:小数丢番图方程极限情形界定
难度评级:3270
小提示:

说明只需让 251251 紧跟在小数点后出现,因此 2511000mn<2521000\frac{251}{1000} \le \frac{m}{n} \lt \frac{252}{1000}

Show it suffices for 251251 to appear immediately after the decimal point, so 2511000mn<2521000\frac{251}{1000} \le \frac{m}{n} \lt \frac{252}{1000}

大提示:

利用相邻分数 14<32127<63250\frac14 \lt \frac{32}{127} \lt \frac{63}{250}:每对相邻分数的交叉差都是 11,这可给出夹在它们之间的分数的分母下界。

Use the neighboring fractions 14<32127<63250:\frac14 \lt \frac{32}{127} \lt \frac{63}{250}: each adjacent pair has cross-difference 1,1, which bounds the denominators between them

解答:

只需考虑让 251251 紧接在小数点后出现。事实上,若 mn=0.A251\frac{m}{n} = 0.A251\ldots,其中 AA 是长度为 k1k \ge 1 的数字块,那么 10kmnA=0.25110^k \frac{m}{n} - A = 0.251\ldots 是介于 0011 之间的分数,约分后的分母不超过 nn。所以要寻找最小的 nn,使某个 mm 满足 2511000mn<2521000\frac{251}{1000} \le \frac{m}{n} \lt \frac{252}{1000}01000m251n<n0 \le 1000m - 251n \lt n\text{。}

分数 32127\frac{32}{127} 位于这个区间内,因为 2511000<32127<63250=2521000 \frac{251}{1000} \lt \frac{32}{127} \lt \frac{63}{250} = \frac{252}{1000}\text{。} 还需证明更小的分母都不可能。使用如下基本事实:若 ab<uv<cd\frac{a}{b} \lt \frac{u}{v} \lt \frac{c}{d},且 bcad=1bc-ad=1,那么 v=b(cvdu)+d(buav)b+d \begin{aligned} v &= b(cv-du)+d(bu-av) \\ &\ge b+d\text{,} \end{aligned} 因为括号中的两个量都是正整数。

现在 4321127=14\cdot32-1\cdot127=1,且 1276332250=1127\cdot63-32\cdot250=1。因此,严格介于 14\frac1432127\frac{32}{127} 之间的每个分数,其分母至少为 4+127=1314+127=131;严格介于 32127\frac{32}{127}63250\frac{63}{250} 之间的每个分数,其分母至少为 127+250=377127+250=377。目标区间包含在 (14,63250)\left(\frac14,\frac{63}{250}\right) 内,并包含 32127\frac{32}{127},所以其中没有分母小于 127127 的分数。

最小可能的 nn127127

It suffices to make 251251 appear immediately after the decimal point: if mn=0.A251\frac{m}{n} = 0.A251\ldots with AA a block of k1k \ge 1 digits, then 10kmnA=0.25110^k \frac{m}{n} - A = 0.251\ldots is a fraction between 00 and 11 whose reduced denominator is at most n.n. So we need the smallest nn admitting an mm with 2511000mn<2521000,\frac{251}{1000} \le \frac{m}{n} \lt \frac{252}{1000}, that is 01000m251n<n.0 \le 1000m - 251n \lt n.

The fraction 32127\frac{32}{127} lies in this interval because 2511000<32127<63250=2521000. \frac{251}{1000} \lt \frac{32}{127} \lt \frac{63}{250} = \frac{252}{1000}. It remains to prove that no smaller denominator works. We use the following elementary fact: if ab<uv<cd\frac{a}{b} \lt \frac{u}{v} \lt \frac{c}{d} and bcad=1,bc-ad=1, then v=b(cvdu)+d(buav)b+d, \begin{aligned} v &= b(cv-du)+d(bu-av) \\ &\ge b+d, \end{aligned} because both parenthesized quantities are positive integers.

Now 4321127=14\cdot32-1\cdot127=1 and 1276332250=1.127\cdot63-32\cdot250=1. Therefore every fraction strictly between 14\frac14 and 32127\frac{32}{127} has denominator at least 4+127=131,4+127=131, while every fraction strictly between 32127\frac{32}{127} and 63250\frac{63}{250} has denominator at least 127+250=377.127+250=377. Since our target interval lies inside (14,63250)\left(\frac14,\frac{63}{250}\right) and contains 32127,\frac{32}{127}, no fraction in it has denominator below 127.127.

The smallest possible value of nn is 127.127.

第 13 题#13
完整试卷

其他年份的第 14 题