Verifying the Goldbach conjecture up to 4⋅10¹⁴

DOI10.1090/S0025-5718-00-01290-4zbMath0989.11050WikidataQ123253514 ScholiaQ123253514MaRDI QIDQ2723545

Jörg Richstein

Publication date: 5 July 2001

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

zbMATH Keywords

distributed computingGoldbach conjecture

Mathematics Subject Classification ID

Goldbach-type theorems; other additive questions involving primes (11P32) Software, source code, etc. for problems pertaining to number theory (11-04) Analytic computations (11Y35)

Related Items (11)

On multiplicative functions which are additive on sums of primes ⋮ Manifold relaxations for integer programming ⋮ Automated conjecturing. I: Fajtlowicz's Dalmatian heuristic revisited ⋮ Computers as a novel mathematical reality. IV: The Goldbach problem ⋮ Refinements of Goldbach's conjecture, and the generalized Riemann hypothesis ⋮ Empirical verification of the even Goldbach conjecture and computation of prime gaps up to 4⋅10¹⁸ ⋮ The continuing search for Wieferich primes ⋮ Oriented bipartite graphs and the Goldbach graph ⋮ Increasing integer sequences and Goldbach's conjecture ⋮ Every odd number greater than $1$ is the sum of at most five primes ⋮ Short effective intervals containing primes

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Prime numbers and computer methods for factorization.
• Numerical results on the Goldbach conjecture
• The segmented sieve of eratosthenes and primes in arithmetic progressions to 1012
• On Strong Pseudoprimes to Several Bases
• Checking the Goldbach Conjecture up to 4 ⋅10 11
• Checking the odd Goldbach conjecture up to 10²⁰
• On checking the Goldbach conjecture
• Experimental Results on Additive 2-Bases
• The First Occurrence of Large Gaps Between Successive Primes

This page was built for publication: Verifying the Goldbach conjecture up to 4⋅10¹⁴