On Wednesday, 22 November 2017 at 04:55:39 UTC, codephantom wrote:
Consider the Goldbach Conjecture, that every even positive integer greater than 2 is the sum of two (not necessarily distinct) primes. According to the principle of bivalence, this should be either true or false.
«The Goldbach conjecture verification project reports that it has computed all primes below 4×10^18»
Which is more than you'll ever need in any regular programming context.
Next problem?
