On checking the Goldbach conjecture

DOI10.1007/BF01939515zbMath0136.33602WikidataQ123242399 ScholiaQ123242399MaRDI QIDQ5511018

Mok-Kong Shen

Publication date: 1964

Published in: BIT (Search for Journal in Brave)

zbMATH Keywords

Goldbach's conjecturedigital computerPERM (TU Munich)TR4 (Bavarian Academy of Science)

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)

Related Items (8)

A simple verification method for the Goldbach conjecture ⋮ Partition into terms with prime numbers ⋮ Computers as a novel mathematical reality. IV: The Goldbach problem ⋮ Numerical results on the Goldbach conjecture ⋮ Verifying the Goldbach conjecture up to 4⋅10¹⁴ ⋮ Empirical verification of the even Goldbach conjecture and computation of prime gaps up to 4⋅10¹⁸ ⋮ A note on Goldbach's conjecture ⋮ On the second Goldbach conjecture

Cites Work

• Fast Method for Computing the Number of Primes Less than a Given Limit
• Unnamed Item

This page was built for publication: On checking the Goldbach conjecture