ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let P\mathcal{P} be the set of prime numbers, let E\mathcal{E} be the set of even natural numbers, and let In\mathcal{I}_n be the nn-primorial interval. Define

Pn=P⋂In,En=E⋂In.\mathcal{P}_n=\mathcal{P}\bigcap\mathcal{I}_n,\qquad \mathcal{E}_n=\mathcal{E}\bigcap\mathcal{I}_n.

Goldbach-Intervals conjecture. For every positive natural number nn and every m∈En+1m\in\mathcal{E}_{n+1}, there are at least two prime numbers p∈Pnp\in\mathcal{P}_n and q∈Pn⋃Pn+1q\in\mathcal{P}_n\bigcup\mathcal{P}_{n+1} such that

m=p+q.m=p+q.

The source reports verification for the first two primorial intervals and says that the first ten intervals can be checked computationally. It also states that this conjecture would imply the binary Goldbach conjecture, but no general proof is supplied.

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.