Find the least positive integer 'n' such that when its leftmost digit is deleted, the resulting number is of the original number. Here deleted is in this sense-if 1 is deleted from 167, 67 is the resulting number. All the numbers mentioned are in base-10 notation
(This is from a problem solving book which didn't give any solutions to the listed problems but listed them as challenges-For anyone who wants to checks it out, the source is this: Adventures In Problem Solving By Shailesh Shirali)
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 the number be ( 1 0 k × x ) + y
Here x is a one-digit natural number and y is any natural number.
if we delete x, resulting number is y
=> y = 5 7 1 × [ ( 1 0 k × x ) + y ]
=> 5 7 5 6 × y = 5 7 1 0 k × x
=> 5 6 × y = 1 0 k × x
Now, see that x is a 1-digit number. If x is not equal to 7, then RHS will not be divisible by 7.
But LHS will still be divisible by 7 as 5 6 × k is divisible by 7
This is a contradiction, thus x = 7 .
Thus 8 × y = 1 0 k
thus 8 divides 1 0 k completely
thus minimum value of k is 3
At k = 3 , y = 1 2 5
Hence n = 7 1 2 5 (n was the original number)
This is the least value of n.
For k=4, 5, 6 and so on, n=71250, 712500 and so on.