How many four-digit palindromes are perfect powers?
Note: A perfect power is a number which is a power (2 or greater) of an integer.
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.
Let the four digit palindromic number be A B B A = 1 0 0 1 A + 1 1 0 B = 1 1 ( 9 1 A + 1 0 B ) . Then 9 1 A + 1 0 B ≤ 9 0 9 . Also 9 1 A + 1 0 B must either be of the form 1 1 a 2 , a ≤ 9 , or 1 1 3 = 1 3 3 1 . Since 2 2 3 = 1 0 6 4 8 > 9 9 9 9 , no other perfect powers are possible. A direct check shows that 1 1 9 1 A + 1 0 B is not a perfect square for any integer value of 0 ≤ A , B ≤ 9 . So the only possible number is 1 3 3 1 = 1 1 3 which is four digit palindromic. Hence the answer is 1 .
Problem Loading...
Note Loading...
Set Loading...
Let the palindromes be a b b a = 1 0 0 1 a + 1 1 0 b , where a and b are single-digit integer. Since 1 0 0 1 a + 1 1 0 b is divisible by 1 1 , the powers we look for must be of the form ( 1 1 n ) p , where n and p are positive integers. For p = 2 , we note that none of the 1 2 1 n 2 is a four-digit palindrome. For p = 3 , we have 1 3 3 1 n 3 and note that when n = 1 we get 1 3 3 1 as a four-digit palindrome, For n > 1 the cube number has five or more digits. For p > 3 , the power number is larger than five-figure. Therefore 1 3 3 1 is the only perfect power and the answer is 1 .