Maths Olympiad Prep

Library / /195 of 377

Number theory Difficulty 5.1 AIME, harder Prove it United States

Problem:
A palindrome is a positive integer that reads the same backwards as forwards, such as 8232882328. What is the smallest 55-digit palindrome that is a multiple of 9999?

Solution

Solution:
Write the number as XYZYXX Y Z Y X. This is the same as 10000X+1000Y+100Z+10Y+X=99(101X+10Y+Z)+20Y+2X+Z10000 X + 1000 Y + 100 Z + 10 Y + X = 99(101 X + 10 Y + Z) + 20 Y + 2 X + Z. We thus want 20Y+2X+Z20 Y + 2 X + Z to be a multiple of 9999, with XX as small as possible. This expression cannot be larger than 209+29+9=20720 \cdot 9 + 2 \cdot 9 + 9 = 207, and it is greater than 00 (since X0X \neq 0), so for this to be a multiple of 9999, it must equal 9999 or 198198. Consider these two cases.

To get 198198, we must have Y=9Y = 9, which then leaves 2X+Z=182 X + Z = 18. The smallest possible XX is 55, and then ZZ becomes 88 and we have the number 5989559895.

To get 9999, we must have Y=4Y = 4. Then, 2X+Z=192 X + Z = 19, and, as above, we find the minimal XX is 55 and then Z=9Z = 9. This gives us the number 5494554945. 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.

Source: MathNet, licensed CC-BY-4.0. Statement reproduced verbatim; metadata (topic, difficulty) added by this project.