返回题库

AIME 2003 I · 第 14 题

AIME 2003 I — Problem 14

专题
Contest Math
难度
L4
来源
AIME

题目详情

Problem

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

解析

Solution

To find the smallest value of nn, we consider when the first three digits after the decimal point are 0.2510.251\ldots.

Otherwise, suppose the number is in the form of mn=0.X251\frac{m}{n} = 0.X251 \ldots, where XX is a string of kk digits and nn is small as possible. Then 10kmnX=10kmnXn=0.25110^k \cdot \frac{m}{n} - X = \frac{10^k m - nX}{n} = 0.251 \ldots. Since 10kmnX10^k m - nX is an integer and 10kmnXn\frac{10^k m - nX}{n} is a fraction between 00 and 11, we can rewrite this as 10kmnXn=pq\frac{10^k m - nX}{n} = \frac{p}{q}, where qnq \le n. Then the fraction pq=0.251\frac pq = 0.251 \ldots suffices.

Thus we have mn=0.251\frac{m'}{n} = 0.251\ldots, or

2511000mn<2521000251n1000m<252nn250(4mn)<2n.\frac{251}{1000} \le \frac{m'}{n} < \frac{252}{1000} \Longleftrightarrow 251n \le 1000m' < 252n \Longleftrightarrow n \le 250(4m'-n) < 2n.

As 4m>n4m' > n, we know that the minimum value of 4mn4m' - n is 11; hence we need 250<2n125<n250 < 2n \Longrightarrow 125 < n. Since 4mn=14m' - n = 1, we need n+1n + 1 to be divisible by 44, and this first occurs when n=127n = \boxed{ 127 } (note that if 4mn>14m'-n > 1, then n>250n > 250). Indeed, this gives m=32m' = 32 and the fraction 321270.25196\frac {32}{127}\approx 0.25196 \ldots).

Solution 2

Rewrite the problem as having the smallest nn such that we can find an positive integer mm such that 0<mn2511000<110000<\frac{m}{n}-\frac{251}{1000}<\frac{1}{1000}.

We can rewrite the expression as 1000m251n1000n\frac{1000m-251n}{1000n}, and we need 251n+x251n+x (where xx is the difference in the fraction, and ranging from (1,2,...n1)(1,2,...n-1) to be 00 mod 10001000. We see that nn must be 33 mod 44 to have this happen (as this reduces the distance between the expression and 10001000.

Rewriting nn as 4k+34k+3, we get that 251(4k+3)+(4k+2)251(4k+3)+(4k+2) turns into 8k+7558k+755, and this has to be greater than or equal to 10001000. The least kk that satisfies this is 3131, and we consequently get that the least value of nn is 127127. -dragoon -minor edits by Mathkiddie