The conjecture on prime numbers that are palindromic in base b
Statement
Let be an integer. A positive integer is -palindromic if its sequence of base- digits is a palindrome, and let denote the set of positive -palindromic integers at most . Palindromic-prime conjecture. There are infinitely many prime numbers that are -palindromic. In fact, for sufficiently large ,
This is presented as a difficult unsolved problem concerning the expected distribution of primes among base- palindromic integers.
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.