Access

You are not currently logged in.

Access your personal account or get JSTOR access through your library or other institution:

login

Log in to your personal account or through your institution.

If You Use a Screen Reader

This content is available through Read Online (Free) program, which relies on page scans. Since scans are not currently available to screen readers, please contact JSTOR User Support for access. We'll provide a PDF copy for your screen reader.

Checking the Goldbach Conjecture up to 4 · 1011

Matti K. Sinisalo
Mathematics of Computation
Vol. 61, No. 204 (Oct., 1993), pp. 931-934
DOI: 10.2307/2153264
Stable URL: http://www.jstor.org/stable/2153264
Page Count: 4
  • Read Online (Free)
  • Download ($34.00)
  • Subscribe ($19.50)
  • Cite this Item
Since scans are not currently available to screen readers, please contact JSTOR User Support for access. We'll provide a PDF copy for your screen reader.
Checking the Goldbach Conjecture up to 4 · 1011
Preview not available

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 · 1011 by the IBM 3083 mainframe with vector processor is reported.

Page Thumbnails

  • Thumbnail: Page 
931
    931
  • Thumbnail: Page 
932
    932
  • Thumbnail: Page 
933
    933
  • Thumbnail: Page 
934
    934