Are all palindromes divisible by 11? (Bonus: Under what condition is a palindrome divisible by 11?)
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.
As for the Bonus question: all palindromes with an even number of digits are divisible by 1 1 . For example, consider a 6-digit palindrome:
a b c c b a = a ( 1 0 5 + 1 ) + b × 1 0 2 × ( 1 0 3 + 1 ) + c × 1 0 3 × ( 1 0 1 + 1 ) .
But for odd n we have that 1 0 n + 1 = ( 1 1 − 1 ) n + 1 ≡ 0 ( m o d 1 1 ) , and since every term in the expansion of our palindrome has 1 0 n + 1 with odd n as a factor, we can conclude that it is divisible by 1 1 . By a similar argument this result will hold for any palindrome with an even number of digits.
Problem Loading...
Note Loading...
Set Loading...
All single digit numbers are palindromes that are not divisible by 1 1 .
While all two-digit palindromes are divisible by 1 1 , the first three-digit palindrome, 1 0 1 , is prime (and thus not divisible by 1 1 .