New experimental results concerning the Goldbach conjecture (1998)

Cached

Download Links

by J-M. Deshouillers , H. J. J. Te Riele , Y. Saouter
Venue:ALGORITHMIC NUMBER THEORY (THIRD INTERNATIONAL SYMPOSIUM, ANTS-III
Citations:2 - 1 self

Active Bibliography

6 A complete Vinogradov 3-primes theorem under the Riemann hypothesis – J. -m. Deshouillers, G. Effinger, H. Te Riele, D. Zinoviev, Communicated Hugh Montgomery - 1997
Computational Number Theory at CWI in 1970-1994 – H.J.J. te Riele, J. Van De Lune - 1994
On Partitions of Goldbach’s Conjecture – Max See, Chin Woon - 2000
Landau's Problem on Primes – János Pintz
On a Proof of the Goldbach Conjecture and the Twin Prime Conjecture – Sze Kui Ng - 2006
21 Fast Generation of Prime Numbers and Secure Public-Key Cryptographic Parameters – Ueli M. Maurer - 1995
5 Obstructions to uniformity, and arithmetic patterns in the primes, preprint – Terence Tao
3 Arithmetic progressions and the primes - El Escorial lectures – Terence Tao
Easy numbers for the Elliptic Curve Primality Proving Algorithm – F. Morain - 1992
VERIFYING THE GOLDBACH CONJECTURE UP TO 4 · 10 14 – unknown authors
EXPANSION AND IMPROVEMENT OF SIEVE AND APPLICATION IN GOLDBACH’S PROBLEM – Cheng Hui Ren - 904
1 On Goldbach’s Conjecture – Jailton C. Ferreira - 2002
Some Considerations in Favor of the Truth of Goldbach’s Conjecture – unknown authors
150 The primes contain arbitrarily long arithmetic progressions – Ben Green, Terence Tao
Factorizations of a^n &plusmn; 1, 13 &le; a < 100: Update 2 – Richard P. Brent, Peter L. Montgomery, Herman J. J. te Riele, Henk Boender, Marije Elkenbracht-huizing, Robert Silverman, Thomas Sosnowski - 1996
Enjeux Et Avancées De La Théorie Algorithmique Des Nombres – François Morain - 1992
Factorizations of a^n&plusmn;1, 13 &le; a < 100: Update 2 – Richard P. Brent, Peter L. Montgomery, Herman J.J. te Riele, Henk Boender, Marije Elkenbracht-huizing, Robert Silverman, Thomas Sosnowski
unknown title – David Broadhurst - 2008
unknown title – David Broadhurst - 2008