Checking the odd Goldbach conjecture up to 10²⁰

Saouter, Yannick

doi:10.1090/S0025-5718-98-00928-4

Checking the odd Goldbach conjecture up to $10^{20}$
HTML articles powered by AMS MathViewer

by Yannick Saouter PDF

Math. Comp. 67 (1998), 863-866 Request permission

Abstract:

Vinogradov’s theorem states that any sufficiently large odd integer is the sum of three prime numbers. This theorem allows us to suppose the conjecture that this is true for all odd integers. In this paper, we describe the implementation of an algorithm which allowed us to check this conjecture up to $10^{20}$.

References

A. O. L. Atkin and F. Morain, Elliptic curves and primality proving, Math. Comp. 61 (1993), no. 203, 29–68. MR 1199989, DOI 10.1090/S0025-5718-1993-1199989-X
John Brillhart, D. H. Lehmer, and J. L. Selfridge, New primality criteria and factorizations of $2^{m}\pm 1$, Math. Comp. 29 (1975), 620–647. MR 384673, DOI 10.1090/S0025-5718-1975-0384673-1
J.R. Chen, On the representation of a large even integer as the sum of a prime and the product of at most two primes, Kexue Tongbao (1966), no. 17, 385–386.
J.M. Deshouillers, G.Effinger, H. te Riele, and D.Zinoviev, A complete Vinogradov $3$-primes theorem under the Riemann Hypothesis, Preprint, 1997.
T. Grandlung, The GNU multiple precision arithmetic library, Technical documentation, 1993.
L. Schnirelmann, Über additive Eigenschaften von Zahlen, Math. Ann. (1933), no. 107, 649–660.
Matti K. Sinisalo, Checking the Goldbach conjecture up to $4\cdot 10^{11}$, Math. Comp. 61 (1993), no. 204, 931–934. MR 1185250, DOI 10.1090/S0025-5718-1993-1185250-6
I.M. Vinogradov, Representation of an odd number as the sum of three primes, Dokl. Akad. Nauk SSSR (1937), no. 15, 169–172.
Tian Ze Wang and Jing Run Chen, On odd Goldbach problem under general Riemann hypothesis, Sci. China Ser. A 36 (1993), no. 6, 682–691. MR 1246313
D.Zinoviev, On Vinogradov’s constant in Goldbach’s ternary problem, J. Number Theory 65 (1997), 334–358.