Checking the goldbach conjecture up to 4 • 1011

Mathematics of Computation

Volumn 61, Issue 204, 1993, Pages 931-934

  Sinisalo, Matti K ^a  

^a UNIVERSITY OF OULU   (Finland)

Author keywords

Eratosthenes sieve method; Goldbach conjecture

Indexed keywords

EID: 84968466804     PISSN: 00255718     EISSN: None     Source Type: Journal    
DOI: 10.1090/S0025-5718-1993-1185250-6     Document Type: Article

References (7)

1. Mok Kong Shen, On checking the Goldbach conjecture, BIT 4 (1964), 243-245.
2. M. L. Stein and P. R. Stein, Experimental results on additive 2-bases, Math. Comp. 19 (1965), 427-434.
3. Jan Bohman and Carl-Erik Fröberg, Numerical results on the Goldbach conjecture, BIT 15 (1975), 239-243.
4. W. A. Light, J. Forrest, N. Hammond, and S. Roe, A note on Goldbach ’s conjecture, BIT 79(1980), 525.
5. A. Granville, J. van de Lune, and H. J. J. te Riele, Checking the Goldbach conjecture on a vector computer, Number Theory and Applications (R. A. Mollin, ed.), Kluwer, Dordrecht, 1989, pp. 423-433.
6. Jingrun Chen and Tianze Wang, On the odd Goldbach problem, Acta Math. Sinica 32 (1989), 702-718. (Chinese)
7. Jeff Young and Aaron Potier, First occurrence prime gaps, Math. Comp. 52 (1989), 221-224.