返回题库

AIME 2006 I · 第 3 题

AIME 2006 I — Problem 3

专题
Contest Math
难度
L4
来源
AIME

题目详情

Problem

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.

解析

Solutions

Solution 1

Suppose the original number is N=anan1a1a0,N = \overline{a_na_{n-1}\ldots a_1a_0}, where the aia_i are digits and the first digit, an,a_n, is nonzero. Then the number we create is N0=an1a1a0,N_0 = \overline{a_{n-1}\ldots a_1a_0}, so

N=29N0.N = 29N_0. But NN is N0N_0 with the digit ana_n added to the left, so N=N0+an10n.N = N_0 + a_n \cdot 10^n. Thus,

N0+an10n=29N0N_0 + a_n\cdot 10^n = 29N_0 an10n=28N0.a_n \cdot 10^n = 28N_0. The right-hand side of this equation is divisible by seven, so the left-hand side must also be divisible by seven. The number 10n10^n is never divisible by 7,7, so ana_n must be divisible by 7.7. But ana_n is a nonzero digit, so the only possibility is an=7.a_n = 7. This gives

710n=28N07 \cdot 10^n = 28N_0 or

10n=4N0.10^n = 4N_0. Now, we want to minimize both nn and N0,N_0, so we take N0=25N_0 = 25 and n=2.n = 2. Then

N=7102+25=725,N = 7 \cdot 10^2 + 25 = \boxed{725}, and indeed, 725=2925.725 = 29 \cdot 25. \square

Solution 2

Let NN be the required number, and NN' be NN with the first digit deleted. Now, we know that N<1000N<1000 (because this is an AIME problem). Thus, NN has 1,1, 22 or 33 digits. Checking the other cases, we see that it must have 33 digits. Let N=abcN=\overline{abc}, so N=100a+10b+cN=100a+10b+c. Thus, N=bc=10b+cN'=\overline{bc}=10b+c. By the constraints of the problem, we see that N=29NN=29N', so

100a+10b+c=29(10b+c).100a+10b+c=29(10b+c). Now, we subtract and divide to get

100a=28(10b+c)100a=28(10b+c) 25a=70b+7c.25a=70b+7c. Clearly, cc must be a multiple of 55 because both 25a25a and 70b70b are multiples of 55. Thus, c=5c=5. Now, we plug that into the equation:

25a=70b+7(5)25a=70b+7(5) 25a=70b+3525a=70b+35 5a=14b+7.5a=14b+7. By the same line of reasoning as earlier, a=7a=7. We again plug that into the equation to get

35=14b+735=14b+7 b=2.b=2. Now, since a=7a=7, b=2b=2, and c=5c=5, our number N=100a+10b+c=725N=100a+10b+c=\boxed{725}.

Here's another way to finish using this solution. From the above, you have

100a=28(10b+c).100a = 28(10b + c). Divide by 44, and you get

25a=7(10b+c).25a = 7(10b + c). This means that 25a25a has to be divisible by 77, and hence a=7.a = 7. Now, solve for 25=10b+c25 = 10b + c, which gives you a=7,b=2,c=5a = 7, b = 2, c = 5, giving you the number 725\boxed{725}

Solution 3 (Quick)

Note that if we let the last digit be cc we must have 9cc(mod10).9c \equiv c \pmod{10}. Thus we either have c=0c=0 which we can quickly check to be impossible (since the number after digit removal could be 10,20,30) or c=5.c=5. Testing 5, 15, and 25 as the numbers after removal we find that our answer is clearly 2925=725.29 \cdot 25 = 725.

~Dhillonr25

(Note that the quick checking of six numbers was possible thanks to AIME problems having answers less than 1000).

Solution 4

First we try 22 digit numbers like ab\overline{ab}. Removing the leftmost digit gives us bb. Now, using the information we are given we can write the equation:

b10a+b=12910a+b=29b5a=14b\dfrac{b}{10a+b} = \dfrac{1}{29} \Longrightarrow 10a+b=29b \Longrightarrow 5a = 14b . Since 55 and 1414 are relatively prime, the smallest case that works is a=14a = 14, and b=5b = 5, but aa is an digit so the number must be at least 33 digits. We let the number be abc\overline{abc}. So, using the info we know, we can conclude that

10b+c100a+10b+c=12925a70b7c=0\dfrac{10b+c}{100a+10b+c} = \dfrac{1}{29} \Longrightarrow 25a-70b-7c = 0 . Rerraranging gives us

25a=7(10b+c)25a = 7(10b+c) . So, sicne 2525 and 77 are relatively prime, the lowest possible case is that a=7a = 7, and 10b+c=2510b+c = 25.So, we have b=2,c=5b = 2, c = 5. So the desired number is 725\boxed{725}

-jb2015007