Goldbach-Intervals conjecture
Statement
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.
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 inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.