Verified Results
For small values of n, the strong Goldbach conjecture (and hence the weak Goldbach conjecture) can be verified directly. For instance, Nils Pipping in 1938 laboriously verified the conjecture up to n ≤ 105. With the advent of computers, many more values of n have been checked; T. Oliveira e Silva is running a distributed computer search that has verified the conjecture for n ≤ 4 × 1018 (and double-checked up to 2 × 1017).
Read more about this topic: Goldbach's Conjecture
Famous quotes containing the words verified and/or results:
“To regard the successful experiences which ensue from a belief as a criterion of its truth is one thing—and a thing that is sometimes bad and sometimes good—but to assume that truth itself consists in the process by which it is verified is a different thing and always bad.”
—William Pepperell Montague (1842–1910)
“Pain itself can be pleasurable accidentally in so far as it is accompanied by wonder, as in stage-plays; or in so far as it recalls a beloved object to one’s memory, and makes one feel one’s love for the thing, whose absence gives us pain. Consequently, since love is pleasant, both pain and whatever else results from love, in so far as they remind us of our love, are pleasant.”
—Thomas Aquinas (c. 1225–1274)