ProbXiv
Explorersign in
Problem archiveProblem record

Statement

For i≥0i\geq 0 and q>0q>0, let siP(q)s_i^P(q) denote the number of sets of i+1i+1 distinct odd primes whose sum is below qq. Let CiC_i be constants satisfying

1=C0>C1>C2>⋯>0.1=C_0>C_1>C_2>\dots>0.

The odd-prime sum-counting conjecture. For these constants,

siP(q)∼Cii+1qi+1ln⁡(q)i+1.s_i^P(q)\sim \frac{C_i^{i+1}q^{i+1}}{\operatorname{ln}(q)^{i+1}}.

The case i=0i=0 is the prime number theorem and is known; the paper gives approximate values for C1,…,C6C_1,\dots,C_6 from its data. The assertions for higher ii 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 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.