Checking the odd Goldbach conjecture up to 10²⁰
From MaRDI portal
Publication:4383199
DOI10.1090/S0025-5718-98-00928-4zbMath0913.11044WikidataQ56137576 ScholiaQ56137576MaRDI QIDQ4383199
Publication date: 24 March 1998
Published in: Mathematics of Computation (Search for Journal in Brave)
Related Items
Numerical Verification of the Ternary Goldbach Conjecture up to 8.875·1030, Empirical verification of the even Goldbach conjecture and computation of prime gaps up to 4⋅10¹⁸, Computers as a novel mathematical reality. IV: The Goldbach problem, Landau's problems on primes, Short effective intervals containing primes, Fast constructive recognition of a black box group isomorphic to \(S_n\) or \(A_n\) using Goldbach's conjecture, Verifying the Goldbach conjecture up to 4⋅10¹⁴, Two Independent Checkings of the Weak Goldbach Conjecture up to 1027
Uses Software
Cites Work
- Unnamed Item
- On Vinogradov's constant in Goldbach's ternary problem
- On odd Goldbach problem under general Riemann hypothesis
- Elliptic Curves and Primality Proving
- New Primality Criteria and Factorizations of 2 m ± 1
- Checking the Goldbach Conjecture up to 4 ⋅10 11
- A complete Vinogradov 3-primes theorem under the Riemann hypothesis