Let be a positive integer such that is equal to the integer formed by moving the last two digits of to the front of the number. The smallest possible value of has digits and leaves a remainder of when divided by 1000. Find the value of
Details and Assumptions:
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 N = a n a n − 1 a n − 2 … a 2 a 1 , where all the a i s are digits such that a n , a 2 = 0 (to avoid leading zeroes). We want to find the smallest value of N such that
2 a n a n − 1 a n − 2 … a 2 a 1 = a 2 a 1 a n … a 4 a 3 .
Let A = a n a n − 1 … a 4 a 3 and B = a 2 a 1 . The condition rewrites and simplifies into
2 ( 1 0 0 A + B ) 1 9 9 A = 1 0 n − 2 B + A = ( 1 0 n − 2 − 2 ) B .
The right hand side of the equation must be divisible by 199. Since 199 is prime, we must have either 1 9 9 ∣ 1 0 n − 2 − 2 or 1 9 9 ∣ B . As B has two digits, it cannot be divisible by a three-digit number, so it must be true that 1 9 9 ∣ 1 0 n − 2 − 2 . Writing this in modulo notation yields
1 0 n − 2 − 2 1 0 n − 2 1 0 0 ( 1 0 n − 2 ) 1 0 n ≡ 0 ( m o d 1 9 9 ) ≡ 2 ( m o d 1 9 9 ) ≡ 1 0 0 ⋅ 2 ( m o d 1 9 9 ) = 1 ( m o d 1 9 9 ) .
Since we wish to minimize N , we want the smallest value of n for which this is true. But that is precisely equal to ord 1 9 9 ( 1 0 ) , which we can calculate to be n = 9 9 . Thus, N has 99 digits, while A has 97 digits.
Plugging this value of n back into our original condition yields
1 9 9 A A = ( 1 0 9 7 − 2 ) B = 1 9 9 1 0 9 7 − 2 B .
The number 1 9 9 1 0 9 7 − 2 has ⌊ lo g 1 0 ( 1 9 9 1 0 9 7 − 2 ) + 1 ⌋ = 9 5 digits, so we seek the smallest value of B that will make A have 97 digits. By inspection, the minimum such value of B is 20, giving us A = 1 9 9 2 0 ( 1 0 9 7 − 2 ) and N = 1 9 9 2 0 ( 1 0 9 7 − 2 ) ⋅ 1 0 2 + 2 0 = 1 9 9 2 0 ( 1 0 9 9 − 1 ) .
To find the value of k , we find the last three digits of the value of N we just found. The last two digits are B = 2 0 . The hundreds place is the units digit of A , which is 0 because of the factor of 20 in its value. Thus, the last three digits of N are k = 0 2 0 = 2 0 .
Our final answer is n k = 9 9 ( 2 0 ) = 1 9 8 0 . The value of N written out in full is
N = 1 0 0 , 5 0 2 , 5 1 2 , 5 6 2 , 8 1 4 , 0 7 0 , 3 5 1 , 7 5 8 , 7 9 3 , 9 6 9 , 8 4 9 , 2 4 6 , 2 3 1 , 1 5 5 , 7 7 8 , 8 9 4 , 4 7 2 , 3 6 1 , 8 0 9 , 0 4 5 , 2 2 6 , 1 3 0 , 6 5 3 , 2 6 6 , 3 3 1 , 6 5 8 , 2 9 1 , 4 5 7 , 2 8 6 , 4 3 2 , 1 6 0 , 8 0 4 , 0 2 0 .