> Goldbach states: every even number ≥ 4 is a sum of two primes. The naive check for an even n
tries many primes p and hopes that n − p is prime. Our idea is simpler: fix a small set of primes
Q = {q1, . . . , qK} (the “gear”), and for each even n only test p = n − q with q ∈ Q
I don't see how your idea is different from the naive check. As far as I can tell you are basically saying do the naive check but only up to p > 250-300?
I don't see how your idea is different from the naive check. As far as I can tell you are basically saying do the naive check but only up to p > 250-300?