Problem:
A palindrome is a positive integer that reads the same backwards as forwards, such as . What is the smallest -digit palindrome that is a multiple of ?
Solution
Solution:
Write the number as . This is the same as . We thus want to be a multiple of , with as small as possible. This expression cannot be larger than , and it is greater than (since ), so for this to be a multiple of , it must equal or . Consider these two cases.
To get , we must have , which then leaves . The smallest possible is , and then becomes and we have the number .
To get , we must have . Then, , and, as above, we find the minimal is and then . This gives us the number . This is smaller than the other number, so it is the smallest number satisfying the conditions of the problem.
Want a route through all this instead of an archive? The track
puts 2,000 problems in a working order, from AMC 10 level to the IMO shortlist.