2003 AIME I 第 14 题

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

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

14.

mn\frac{m}{n} 的通常小数写法中连续出现数字 2,52, 511,且顺序如此,其中 mmnn 是互质正整数并满足 m<nm \lt n, 求使这成为可能的最小 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,5,2, 5, and 11 consecutively, and in that order. Find the smallest value of nn for which this is possible.

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

只需让 251251 紧跟在小数点后出现:若 mn=.A251\frac{m}{n} = .A251\ldots,其中 AA 是长度 k1k \ge 1 的数字块,则 10kmnA=.25110^k \frac{m}{n} - A = .251\ldots 是一个介于 0011 之间的分数,其约分后的分母不超过 nn。 因此我们要找最小的 nn,使存在 mm 满足 即 2511000mn<2521000,\frac{251}{1000} \le \frac{m}{n} \lt \frac{252}{1000}, 01000m251n<n.0 \le 1000m - 251n \lt n.

因而 32127\frac{32}{127} 必须落在某个 ab<uv<cd\frac{a}{b} \lt \frac{u}{v} \lt \frac{c}{d} 的倍数下方且距离小于 bcad=1bc-ad=12511000<32127<63250=2521000. \frac{251}{1000} \lt \frac{32}{127} \lt \frac{63}{250} = \frac{252}{1000}. v=b(cvdu)+d(buav)b+d, \begin{aligned} v &= b(cv-du)+d(bu-av) \\ &\ge b+d, \end{aligned}

尝试 4321127=14\cdot32-1\cdot127=1: 此时 1276332250=1127\cdot63-32\cdot250=1 14\frac14, 所以当 32127\frac{32}{127} 时,它比 4+127=1314+127=13132127\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

条件 给出 , 因此 、 可行:确实 。 对同一不等式作简短检查可知,没有更小的 nn 能使 位于某个 的倍数上方 且距离小于 ,因为差额 (或其他余数情形的类似差额)仍然太大。 最小可能的 为 127127

It suffices to make 251251 appear immediately after the decimal point: if mn=.A251\frac{m}{n} = .A251\ldots with AA a block of k1k \ge 1 digits, then 10kmnA=.25110^k \frac{m}{n} - A = .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 题