Find the smallest 3-digit palindrome which remains a palindrome in base and is a multiple of 101.
Clarification : Yes, it is indeed and not .
Hint : See this problem .
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.
From the hints in the problem and problem title, you may be able to guess that the answer is 4 0 4 . Indeed, when converting to base − 3 1 , − 3 1 4 0 4 = − 1 3 , r = 1 − 3 1 − 1 3 = 1 , r = 1 3 − 3 1 1 = 0 , r = 1 4 0 4 = 1 : 1 3 : 1 − 3 1 which is a palindrome. Repeating the process for 1 0 1 , 2 0 2 , and 3 0 3 , it can be seen that these are not palindromes in base − 3 1 . Therefore 4 0 4 is the smallest 3-digit multiple of 1 0 1 that is a palindrome in base − 3 1 .