Checking the Goldbach conjecture up to $4\cdot 10^ {11}$
HTML articles powered by AMS MathViewer
- by Matti K. Sinisalo PDF
- Math. Comp. 61 (1993), 931-934 Request permission
Abstract:
One of the most studied problems in additive number theory, Goldbach’s conjecture, states that every even integer greater than or equal to 4 can be expressed as a sum of two primes. In this paper checking of this conjecture up to $4 \cdot {10^{11}}$ by the IBM 3083 mainframe with vector processor is reported.References
- Mok-kong Shen, On checking the Goldbach conjecture, Nordisk Tidskr. Informationsbehandling (BIT) 4 (1964), 243–245. MR 172834, DOI 10.1007/bf01939515 M. L. Stein and P. R. Stein, Experimental results on additive 2-bases, Math. Comp. 19 (1965), 427-434.
- Jan Bohman and Carl-Erik Fröberg, Numerical results on the Goldbach conjecture, Nordisk Tidskr. Informationsbehandling (BIT) 15 (1975), no. 3, 239–243. MR 389814, DOI 10.1007/bf01933655
- W. A. Light, J. Forrest, N. Hammond, and S. Roe, A note on Goldbach’s conjecture, BIT 20 (1980), no. 4, 525. MR 605912, DOI 10.1007/BF01933648
- A. Granville, J. van de Lune, and H. J. J. te Riele, Checking the Goldbach conjecture on a vector computer, Number theory and applications (Banff, AB, 1988) NATO Adv. Sci. Inst. Ser. C: Math. Phys. Sci., vol. 265, Kluwer Acad. Publ., Dordrecht, 1989, pp. 423–433. MR 1123087
- Jing Run Chen and Tian Ze Wang, On the Goldbach problem, Acta Math. Sinica 32 (1989), no. 5, 702–718 (Chinese). MR 1046491
- Jeff Young and Aaron Potler, First occurrence prime gaps, Math. Comp. 52 (1989), no. 185, 221–224. MR 947470, DOI 10.1090/S0025-5718-1989-0947470-1
Additional Information
- © Copyright 1993 American Mathematical Society
- Journal: Math. Comp. 61 (1993), 931-934
- MSC: Primary 11P32; Secondary 11Y35
- DOI: https://doi.org/10.1090/S0025-5718-1993-1185250-6
- MathSciNet review: 1185250