Abstract
This paper gives further numerical results on the conjecture that every odd numbern can be written as 2p +q wherep andq are primes. Strange fluctuations in the least possible value ofq needed are noted, studied, and partially predicted using the Hardy-Littlewood conjecture. Finally values of the Hardy-Littlewood constantsC 2,C 3 ...C 49 are tabulated as they are of use in other numerical verifications but difficult to compute.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
G. H. Hardy, J. E. Littlewood,Some problems of Partitio Numerorum; III: On the expression of a number as a sum of primes, Acta Mathematica 44 (1923), 1–70.
B. H. Mayoh,On the second Goldbach conjecture, BIT 6 (1966), 48–50.
B. H. Mayoh,Remarks on the Hardy-Littlewood conjecture, to appear.
H. E. Salzer,A simple method for summing certain slowly convergent series, J. Math. Phys. 33 (1954), 356–359.
Daniel Shanks,On the conjecture of Hardy & Littlewood concerning the number of primes of form n 2 +a, Mathematics of Computation v. 14 (1960), 321–332.
J. W. Wrench Jr.,Evaluation of Artin's constant and the twin-prime constant, Mathematics of Computation v. 15 (1961), 396–398.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Mayoh, B.H. The second goldbach conjecture revisited. BIT 8, 128–133 (1968). https://doi.org/10.1007/BF01939334
Issue Date:
DOI: https://doi.org/10.1007/BF01939334