ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let πb(k)\pi_b(k) denote the number of base bb dismal primes with kk digits. Prime-counting conjecture. As kk tends to infinity,

πb(k)∼(b−1)2bk−2.\pi_b(k)\sim (b-1)^2b^{k-2}.

The conjecture predicts that asymptotically almost all kk-digit numbers satisfying the necessary digit conditions for primality are dismal primes. It is motivated by the numerical data presented in the paper, but no proof or resolution is given.

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.