Goldbach conjecture prime-closeness query
- Goldbach conjecture: every even number>2 is a sum of two primes: 2N=p+q.
Quantitative version: let f(N) be the least value of |p-q| such that
2N=p+q with p,q prime. [If no such p,q exist then let f(N)=infinity.]
Has there been computational effort devoted to determining the behavior of f(N)?
I presume/guess that
is a valid stronger version of Goldbach conjecture.
If all record-breaking f(N) were computed for N=1..10^12
then we'd have some evidence on this question.