Skip to main content
OlympiadHQ

Browse · MATH

Print

jmc

number theory junior

Problem

Palindromes are numbers that read the same backwards and forwards, like 5665. What is the least possible positive four-digit palindrome that is divisible by 3?
Solution
The smallest four-digit palindromes have on each end. is not divisible by , nor is , but is, so it is the smallest possible.
Final answer
1221