You are not currently logged in.
Access your personal account or get JSTOR access through your library or other institution:
If You Use a Screen ReaderThis 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
Published by: American Mathematical Society
Stable URL: http://www.jstor.org/stable/2153264
Page Count: 4
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.
Preview not available
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.
Mathematics of Computation © 1993 American Mathematical Society