The asymptotic count of dismal primes
Statement
Let denote the number of base dismal primes with digits. Prime-counting conjecture. As tends to infinity,
The conjecture predicts that asymptotically almost all -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 inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.