Editing Goldbach's conjecture (section)

=== Computational results ===
For small values of {{mvar|n}}, the strong Goldbach conjecture (and hence the weak Goldbach conjecture) can be verified directly. For instance, in 1938, Nils Pipping laboriously verified the conjecture up to {{math|''n'' {{=}} {{val|100,000}}}}.<ref>Pipping, Nils (1890–1982), "Die Goldbachsche Vermutung und der Goldbach-Vinogradowsche Satz". Acta Acad. Aboensis, Math. Phys. 11, 4–25, 1938.</ref> With the advent of computers, many more values of {{mvar|n}} have been checked; T. Oliveira e Silva ran a distributed computer search that has verified the conjecture for {{math|''n'' ≤ {{val|4e18}}}} (and double-checked up to {{val|4e17}}) as of 2013. One record from this search is that {{val|3,325,581,707,333,960,528}} is the smallest number that cannot be written as a sum of two primes where one is smaller than 9781.<ref>Tomás Oliveira e Silva, [https://sweet.ua.pt/tos/goldbach.html Goldbach conjecture verification]. Retrieved 20 April 2024.</ref>