An Upper Bound in Goldbach's Problem

DOI10.2307/2152947MaRDI QIDQ3137460zbMATH OpenOpenAlexWikidataFDO

Authors Jean-Marc Deshouillers, Andrew Granville, Władysław Narkiewicz, Carl Pomerance

Publication date 1 November 1993

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

Full work available at URL https://doi.org/10.2307/2152947

zbMATH Keywords

Goldbach's conjecturesum of two primessieve estimatesmaximal numberRosser-Schoenfeld prime number theorem

Mathematics Subject Classification ID

Goldbach-type theorems; other additive questions involving primes (11P32) Applications of sieve methods (11N36) Primality (11Y11) Analytic computations (11Y35)

Recommendations

• scientific article; zbMATH DE number 4112673
• Checking the Goldbach Conjecture up to 4 ⋅10 11
• scientific article; zbMATH DE number 4171046
• Exceptional set of Goldbach number
• scientific article; zbMATH DE number 1186943

Cited in

(12)

• Refinements of Goldbach's conjecture, and the generalized Riemann hypothesis
• Computers as a novel mathematical reality. IV: The Goldbach problem
• A method for searching for prime pairs in the Goldbach conjecture
• A note on Goldbach partitions of large even integers
• Checking the Goldbach Conjecture up to 4 ⋅10 11
• Goldbach's pigeonhole
• scientific article; zbMATH DE number 167876 (Why is no real title available?)
• Deep learning-based approximation of Goldbach partition function
• Totally Goldbach numbers and related conjectures
• scientific article; zbMATH DE number 4112673 (Why is no real title available?)
• A Goldbach Conjecture Using Twin Primes
• On the probabilistic complexity of numerically checking the binary Goldbach conjecture in certain intervals

This page was built for publication: An Upper Bound in Goldbach's Problem

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