2003 AIME I Problem 14

Below is the professionally curated solution for Problem 14 of the 2003 AIME I, from LIVE by Po-Shen Loh. You can also try the full timed exam, view all 2003 AIME I solutions, or check the answer key.

All of the real AMC 8, AMC 10, AMC 12, and AIME problems in our complete solution collection are used with official legal permission of the Mathematical Association of America (MAA).

Concepts:decimalDiophantine Equationbounding to limit cases

Difficulty rating: 3270

14.

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.

Solution:

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,that is01000m251n<n.\frac{251}{1000} \le \frac{m}{n} \lt \frac{252}{1000}, \qquad \text{that is} \qquad 0 \le 1000m - 251n \lt n.

Thus 251n251n must land within nn below a multiple of 1000.1000. Try n=4m1:n = 4m - 1: then 251n=251(4m1)=1000m+(4m251),251n = 251(4m - 1) = 1000m + (4m - 251), so for m62m \le 62 this lies below 1000m1000m by 2514m.251 - 4m. The requirement 2514m<n=4m1251 - 4m \lt n = 4m - 1 gives m>31.5,m \gt 31.5, so m=32m = 32 and n=127n = 127 work: indeed 32127=.2519\frac{32}{127} = .2519\ldots A short check of the same inequality shows no smaller nn puts 1000m1000m within nn above a multiple of 251,251, since the deficit 2514m251 - 4m (or its analogues for other residues) stays too large.

The smallest possible value of nn is 127.127.

← Problem 13Full ExamProblem 15

Problem 14 in Other Years