Checking the odd Goldbach conjecture up to 10²⁰

DOI10.1090/S0025-5718-98-00928-4zbMath0913.11044WikidataQ56137576 ScholiaQ56137576MaRDI QIDQ4383199

Yannick Saouter

Publication date: 24 March 1998

Published in: Mathematics of Computation (Search for Journal in Brave)

zbMATH Keywords

primality testsodd Goldbach conjecture

Mathematics Subject Classification ID

Goldbach-type theorems; other additive questions involving primes (11P32) Primality (11Y11)

Related Items

Computers as a novel mathematical reality. IV: The Goldbach problem, 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¹⁴, Numerical Verification of the Ternary Goldbach Conjecture up to 8.875·10³⁰, Empirical verification of the even Goldbach conjecture and computation of prime gaps up to 4⋅10¹⁸, Two Independent Checkings of the Weak Goldbach Conjecture up to 10²⁷, Landau's problems on primes, Short effective intervals containing primes

Uses Software

• gmp
• ECPP

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