ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let R(n)R(n) denote the number of representations of an integer nn as a sum of two primes. Weak Hardy–Littlewood conjecture. There exists an absolute constant c3>0c_3>0 such that, for every even integer n≥4n\geq 4,

R(n)≥c3nlog⁡2n.R(n)\geq \frac{c_3n}{\log^2 n}.

This lower-bound hypothesis is weaker than the full Hardy–Littlewood asymptotic formula and is used in the source to obtain improved bounds for Siegel zeros; its general validity remains open.

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.