Find the least possible positive integer n such that when the leftmost digit is removed, the remaining number is equal to 2 9 n .
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.
If you take the larger number as 2 9 x and the smaller as x , then you can find the first digit easily. Subtracting, you get the value for 2 8 x = a 0 0 0 0 . . , where a is the first digit. Since the number a 0 0 0 0 . . . is divisible by 2 8 , it can be observed that 2 8 × 2 5 is equal to 7 0 0 , and thus, 7 is the only value for a , which makes a 0 0 0 0 . . . divisible by 2 8 . Since it is multiplied by 2 5 , the two digits coming after the first digit in the larger number must be 2 5 . Thus, the first few numbers which satisfy the question are 7 2 5 , 7 2 5 0 , 7 2 5 0 0 , 7 2 5 0 0 0 . . . . Thus, the general form of this number is:
7 2 5 × 1 0 n , where n ∈ W
Log in to reply
Very nice, and this generalizes easily when 29 is replaced by something else. This also shows that 30 and 32 will not work, but 31 and 33 will :)
Log in to reply
Yes, because 3 0 or 3 2 would become odd and not a multiple of 5 and thus, no multiple would be of the form a 0 0 0 0 . . .
There is a much more efficient way, esp if you want to generate all such numbers.
More generally, what values other than 29 can we replace with? How about 30? 31? 32? (likewise, there is a quick way to determine the answer)
Dude, I'd never seen that. :O It might have just well been 5 2 3 9 5 2 9 1 . Sorry if that affected you in any way. :P
Instead of figuring out n , let's figure out 2 9 n instead. Let's call 2 9 n = x . Clearly, 2 9 x is at least a 3-digit number. Let's assume that is true. Thus, 2 9 x can be represented by 1 0 0 a + x , where a is a digit. Since 2 9 x = 1 0 0 a + x , we have 2 8 x = 1 0 0 a , or 7 x = 2 5 a . Therefore, x = 2 5 and a = 7 .
Finally, n = 2 9 x = 7 2 5 and we are done.
Wow, that solution was a lot less rigorous and a lot more wordy than I intended it to be!
Let consider the number that satisfies the condition is a two digit number like ab . Then 1 0 a + b = 2 9 b so b = 1 4 5 a It means the least possible value of a is 14, as b is an integer but it is not possible because a,b,c lies in the interval [0,9] and they are all integer. So the number is not a two digit number. Let consider the number is a three digit number like abc . Then 1 0 0 a + 1 0 b + c = 2 9 ( 1 0 b + c ) so 1 0 b + c = 7 2 5 c Then the least possible value of c is 7. So 1 0 b + c = 2 5 . It means that b=2,c=5. Then the number is 725
Where did 100a go?
let the leftmost digit be x.
then acc. to ques. , no. would be x * (power of 10) + n/29
i.e. n = x * (power of 10) + n/29
which implies, n - n/29 = x * (power of 10)
n*28/29 = x * (power of 10)
RHS is integral , therefore n must be a multiple of 29 say 29k.
so, 28*k = x * (power of 10)
4
7
k = x * (power of 10) , there is no no. which when multiplied by 7 fetches a power of 10,
so x is essentially a multiple of 7 ,infact it is 7 as x is a digit.
now, 4*k = power of 10
clearly min. k = 25 , which gives n= 29 * 25 = 725
lets say number is 100x+10y+z
so equality will become
10y+z = 100x+10y+z / 29
28(10y+z) = 100x
4*7(10y+z) = 100 x
x has to be 7
4*(10y+z) = 100 = 4 * 25
and y = 2 and z = 5
so number 725
How do you know it's a three digit number?
Let the first digit be a . If n has (b+1) digits, removing a would reduce its value by a × 1 0 b
So we have n − a × 1 0 b = 2 9 n
2 9 2 8 n = a × 1 0 b
2 8 n = 2 9 a × 1 0 b
Since 28 and 29 are coprime, a × 1 0 b must be divisible by 2 8 or 2 2 × 7 .
1 0 b is no way divisible by 7 so b must be divisible by 7. Since b is single digit, b = 7
Now 2 8 n = 2 9 × 7 × 1 0 b
4 n = 2 9 × 1 0 b
For 2 9 × 1 0 b to be a multiple of 4, b must be at least 2
4 n = 2 9 0 0
n = 7 2 5
Problem Loading...
Note Loading...
Set Loading...
Just a note: this is quite similar to the 2006 AIME I Problem #3. Remember to credit your sources!
Let's take a simple approach.
Let our number be n , where n is a positive integer of the form a b c ( a , b and c do not necessarily need to be distinct) and that satisfies the above property. Thus, b c = 2 9 a b c .
We know that the only possible other factor of n must end in either 0 or in 5 , because those are the only numbers that, when multiplied by 2 9 , produce a product with the same last digit. Thus, our search is limited to cases where the other factor is a multiple of 5 . This makes our search a whole lot easier.
Now, we start to search for the number we seek. A quick listing of the numbers can give us 1 4 5 , 2 9 0 , 4 3 5 , 5 8 0 , 7 2 5 -- STOP. That's it. We're done. 2 5 × 2 9 = 7 2 5 .
That's how I did it, any more efficient ways?