# Goldbach's conjecture with negative primes

Is the Goldbach conjecture any easier if we allow primes to be negative as well? That is, every even integer is the sum or difference of two primes. The twin prime conjecture talks about the occurrence of a certain kind of prime gap, but I don't know if all even integers can be a prime gap (which would imply the Goldbach conjecture for $\Bbb Z$).

• Nobody else knows either. You might look up Polignac's conjecture. – Robert Israel Aug 14 '16 at 6:10
• See also this MathOverflow discussion – Robert Israel Aug 14 '16 at 6:11
• @RobertIsrael My conjecture is a priori a bit weaker than Polignac's, because I only want one prime gap for each even integer, not infinitely many. Unless there is an easy way to get infinitely many given a method producing one? – Mario Carneiro Aug 14 '16 at 6:13
• Is it true that in some probabilistic model of the primes, the probability that $2n$, $n>0$ is a prime gap at least once is $1$? – Mario Carneiro Aug 14 '16 at 6:31
• @Charles You should make that an answer, since I don't expect much more as this is an open problem. – Mario Carneiro Aug 14 '16 at 18:08

## 1 Answer

Generally all the methods we have to produce gaps give us infinitely many, so the consensus seems to be that "infinitely many" is not much, or at all, harder than the "at least one" case.

Under Cramer's model this holds with probability 1.

• Could you sketch the argument for the probability 1 claim? – Mario Carneiro Aug 14 '16 at 18:38
• Not from my phone. Maybe next week when I'm home. – Charles Aug 14 '16 at 18:58
• I'm sure the internet can provide a discussion of how the twin prime conjecture holds with probability $1$ in the Cramer model. Generalizing the difference from $2$ to $2N$ won't change anything in that argument. – Greg Martin Aug 14 '16 at 19:11