Checking the Goldbach Conjecture up to 4 ⋅10 11
From MaRDI portal
Publication:4274409
DOI10.2307/2153264zbMath0783.11037OpenAlexW4254911770WikidataQ56081303 ScholiaQ56081303MaRDI QIDQ4274409
Publication date: 6 January 1994
Published in: Mathematics of Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.2307/2153264
Goldbach-type theorems; other additive questions involving primes (11P32) Software, source code, etc. for problems pertaining to number theory (11-04)
Related Items
Computers as a novel mathematical reality. IV: The Goldbach problem ⋮ Verifying the Goldbach conjecture up to 4⋅10¹⁴ ⋮ A complete Vinogradov 3-primes theorem under the Riemann hypothesis ⋮ Checking the odd Goldbach conjecture up to 10²⁰ ⋮ Empirical verification of the even Goldbach conjecture and computation of prime gaps up to 4⋅10¹⁸
This page was built for publication: Checking the Goldbach Conjecture up to 4 ⋅10 11
