On checking the Goldbach conjecture

DOI10.1007/BF01939515MaRDI QIDQ5511018zbMATH OpenWikidataFDO

Authors Mok-Kong Shen

Publication date 1964

Published in BIT (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/BF01939515

zbMATH Keywords

digital computerGoldbach's conjecturePERM (TU Munich)TR4 (Bavarian Academy of Science)

Mathematics Subject Classification ID

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

Cites work

• Fast Method for Computing the Number of Primes Less than a Given Limit
• scientific article; zbMATH DE number 3037588 (Why is no real title available?)

Cited in

(9)

• Partition into terms with prime numbers
• Verifying the Goldbach conjecture up to \(4\cdot 10^{14}\)
• A note on Goldbach's conjecture
• Numerical results on the Goldbach conjecture
• A simple verification method for the Goldbach conjecture
• Empirical verification of the even Goldbach conjecture and computation of prime gaps up to 4⋅10¹⁸
• On the second Goldbach conjecture
• On A Necessary Condition for the Validity of Goldbach's Conjecture
• Computers as a novel mathematical reality. IV: The Goldbach problem

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5511018)