Numerical computations seem to show that is always less than whenever . Solving the equation , one gets as a threshold the value , hence every even integer greater than is the sum of two primes, as the small cases (less than ) can be easily checked by hand.