Hardy–Littlewood asymptotic conjecture for BCC primes with p≡1pmod4
Statement
Let count BCC primes satisfying , and define
Let
where the product is over primes , and let be the constant given by
BCC-prime asymptotic conjecture. As ,
The formula is the paper’s Hardy–Littlewood-style heuristic prediction for the refined BCC-prime counting function, supported by the computational data presented there.
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.