Skip to main content
OlympiadHQ

Browse · MATH

Print

jmc

prealgebra senior

Problem

A is an integer that reads the same forwards and backwards. How many positive 3-digit palindromes are multiples of ?
Solution
A -digit palindrome must be of the form , where and are digits, and . In order for to be divisible by , we require that be divisible by . Since and , the maximum possible value of is . We will list all of the multiples of from through , and determine how many possibilities for make equal to that multiple.

If , then there are no solutions such that . If , then , so is the only solution. If , then , so , since will make negative. If , then , so , since will make negative. If , then , so , since will make , and will make negative. If , then , so , since will make , and will make negative. If , then , so , since will make , and must be less than . If , then , so , since will make , and must be less than . If , then , so , since will make , and must be less than . If , then , so , since as we've seen and must both be as large as possible.

In each case, a value of uniquely determines a value of , so we haven't missed any palindromes. Thus the total number is .
Final answer
30