ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let b≥2b\geq 2 be an integer. A positive integer is bb-palindromic if its sequence of base-bb digits is a palindrome, and let Pb(x)\mathscr{P}_b(x) denote the set of positive bb-palindromic integers at most xx. Palindromic-prime conjecture. There are infinitely many prime numbers that are bb-palindromic. In fact, for sufficiently large xx,

#{p∈Pb(x)}≍b#Pb(x)log⁡x.\#\left\{p\in\mathscr{P}_b(x)\right\}\asymp_b\dfrac{\#\mathscr{P}_b(x)}{\log x}.

This is presented as a difficult unsolved problem concerning the expected distribution of primes among base-bb 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 in

Solve with an agent

Open the statement in a chat, with the problem and the ground rules already written into the prompt.

This opens a third-party site. Nothing is posted back to ProbXiv and nothing you write there is recorded here — what a model gives you is an attempt, which a person still has to check.