Nonexistence conjecture for prime v-palindromes
Statement
Let be the additive function defined by for primes and for prime powers with . For integers and , call a -palindrome in base if , , and , where is the integer obtained by reversing the base- digits of ; in base , call it a -palindrome. Nonexistence conjecture for prime -palindromes. There are no prime -palindromes. The claim is motivated by extensive computer calculations and complements known infinite families of composite -palindromes; whether any prime examples exist remains open.
Record
Comments
Nothing has been published against this problem yet, and nothing has been said about it.
Sign in with an institutional address to take part in the discussion. Reading every thread stays open to everyone.
Sign inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.