Skip to main content
Log in

Numerical results on the Goldbach conjecture

  • Published:
BIT Numerical Mathematics Aims and scope Submit manuscript

Abstract

The number of Goldbach partitions has been computed for all even numbers ≦ 350,000 and compared to well-known theoretical estimates. The random fluctuations are slowly decreasing and less than ± 5 per cent at the upper end of the interval. The number of partitions is given explicitly for 2n,n=3(1)22. Further, if for a givenN the smallest prime in all partitions of 2N isa=a(2N) we have also determineda 1(2N 1)<a 2(2N 2)<... withN 1<N 2<... such thatn<N k impliesa(2n)<a k (2N k ) up to 2n=40,000,000.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Similar content being viewed by others

References

  1. Mok-Kong Shen,On Checking the Goldbach Conjecture, BIT 4 (1964), 243–245.

    Google Scholar 

  2. V. Brun,Über das Goldbachsche Gesetz und die Anzahl der Primzahlpaare, Arch. f. Math. og Naturv., B. XXXIV, Nr. 8, 1916.

  3. G. H. Hardy and J. E. Littlewood,Some problems of “Partitio numerorum” III:On the Expression of a Number as a Sum of Primes, Acta Math. 44, 1923.

  4. Ernst S. Selmer,Eine neue hypothetische Formel für die Anzahl der Goldbachschen Spaltungen einer geraden Zahl, und eine numerische Kontrolle, Arch. f. Math. og Naturv., B. XLVI, Nr. 1, 1942.

Download references

Author information

Authors and Affiliations

Authors

Rights and permissions

Reprints and permissions

About this article

Cite this article

Bohman, J., Fröberg, CE. Numerical results on the Goldbach conjecture. BIT 15, 239–243 (1975). https://doi.org/10.1007/BF01933655

Download citation

  • Received:

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF01933655

Keywords

Navigation