2006 AIME I Problems/Problem 3
Contents
Problem
Find the least positive integer such that when its leftmost digit is deleted, the resulting integer is of the original integer.
Solutions
Solution 1
Suppose the original number is where the
are digits and the first digit,
is nonzero. Then the number we create is
so
But
is
with the digit
added to the left, so
Thus,
The right-hand side of this equation is divisible by seven, so the left-hand side must also be divisible by seven. The number
is never divisible by
so
must be divisible by
But
is a nonzero digit, so the only possibility is
This gives
or
Now, we want to minimize both
and
so we take
and
Then
and indeed,
Solution 2
Let be the required number, and
be
with the first digit deleted. Now, we know that
(because this is an AIME problem). Thus,
has
or
digits. Checking the other cases, we see that it must have
digits.
Let
, so
. Thus,
. By the constraints of the problem, we see that
, so
Now, we subtract and divide to get
Clearly,
must be a multiple of
because both
and
are multiples of
. Thus,
. Now, we plug that into the equation:
By the same line of reasoning as earlier,
. We again plug that into the equation to get
Now, since
,
, and
, our number
.
Here's another way to finish using this solution. From the above, you have Divide by
, and you get
This means that
has to be divisible by
, and hence
Now, solve for
, which gives you
, giving you the number
Solution 3 (Quick)
Note that if we let the last digit be we must have
Thus we either have
which we can quickly check to be impossible (since the number after digit removal could be 10,20,30) or
Testing 5, 15, and 25 as the numbers after removal we find that our answer is clearly
~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 digit numbers like
. Removing the leftmost digit gives us
. Now, using the information we are given we can write the equation:
. Since
and
are relatively prime, the smallest case that works is
, and
, but
is an digit so the number must be at least
digits. We let the number be
. So, using the info we know, we can conclude that
. Rerraranging gives us
. So, sicne
and
are relatively prime, the lowest possible case is that
, and
.So, we have
. So the desired number is
-jb2015007
See also
2006 AIME I (Problems • Answer Key • Resources) | ||
Preceded by Problem 2 |
Followed by Problem 4 | |
1 • 2 • 3 • 4 • 5 • 6 • 7 • 8 • 9 • 10 • 11 • 12 • 13 • 14 • 15 | ||
All AIME Problems and Solutions |
These problems are copyrighted © by the Mathematical Association of America, as part of the American Mathematics Competitions.