Browse · MATH
Printjmc
counting and probability senior
Problem
For some integers that are not palindromes, like 91, a person can create a palindrome by repeatedly reversing the number and adding the original number to its reverse. For example, . Then , which is a palindrome, so 91 takes two steps to become a palindrome. Of all positive integers between 10 and 100, what is the sum of the non-palindrome integers that take exactly six steps to become palindromes?
Solution
Say our two-digit non-palindrome is , with and digits. Reversing and adding it to itself is . This operation only depends on , so 57 and 48 for example yield the same result. When , the resulting number is just a number in , all of which are palindromes, so numbers with take one step. We can now check how many times the operation needs to be applied on each remaining value of . Since , . The only two values of which require exactly six steps are and . However, the only for which is , a palindrome. We are left with , as we exclude the palindrome .
Final answer
176