What is the smallest positive integer such that when the leftmost digit is removed, the new number is 1/29 of the original number?
This problem is not original - it's an old AIME problem.
This section requires Javascript.
You are seeing this because something didn't load right. We suggest you, (a) try
refreshing the page, (b) enabling javascript if it is disabled on your browser and,
finally, (c)
loading the
non-javascript version of this page
. We're sorry about the hassle.
Let x minus its leading digit be equal to one 29th x:
x − β 1 0 n = 2 9 1 x
2 9 2 8 x = β 1 0 n
At this point, it can be seen that the factors of 28 are 4 & 7. Thus, for β 1 0 n to be divisible by 28, β must be a multiple of 7. In this case, it would be 7.
2 9 2 8 x = 7 ⋅ 1 0 n
2 9 4 x = 1 0 n
Since 10 has factors 2 & 5, there must be at least two tens to cancel out the 4 on the left hand side. Thus:
2 9 1 x = 2 5 ⋅ 1 0 n − 2
x = 7 2 5 ⋅ 1 0 n − 2
As mentioned earlier, the smallest amount of tens required to cancel out the 4 was 2, thus by substituting 2 in for n:
x = 7 2 5