Goldbach-Intervals conjecture

About 3 years old · traced to

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.

References

Primary source

Jonatan Gomez, “On Primorial Numbers”, arXiv:2301.02770 (2023).

Progress summary

Never refreshed

Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.

Solutions 0

No solutions have been posted yet.