The asymptotic counting conjecture for sums of distinct odd primes
Statement
For and , let denote the number of sets of distinct odd primes whose sum is below . Let be constants satisfying
The odd-prime sum-counting conjecture. For these constants,
The case is the prime number theorem and is known; the paper gives approximate values for from its data. The assertions for higher are presented as asymptotic conjectures supported by numerical heuristics.
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.