Goldbach-Intervals conjecture
Goldbach-Intervals conjecture
Let be the set of prime numbers, let be the set of even natural numbers, and let be the -primorial interval. Define
Goldbach-Intervals conjecture. For every positive natural number and every , there are at least two prime numbers and such that
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.
Progress summary
Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.
Sources & referencesView supporting material
Primary source
Jonatan Gomez, “On Primorial Numbers”, arXiv:2301.02770 (2023).
Solutions 0
Sign in to submit a solution.
No solutions have been posted yet.