On a numerical upper bound for the extended Goldbach conjecture
David Quarel

TL;DR
This paper investigates an upper bound related to the Goldbach conjecture, improves approximation methods for the Buchstab function, and refines the computation of Chen's constant, providing experimental insights into the conjecture's bounds.
Contribution
The authors improve the approximation of the Buchstab function and refine the computation of Chen's constant, offering experimental evidence on the bounds related to the Goldbach conjecture.
Findings
Refined approximation of the Buchstab function using Taylor expansions.
Discretized integrals with finer granularity showed negligible improvement to Chen's constant.
Experimental evidence suggests that significant improvements require fundamentally different methods.
Abstract
The Goldbach conjecture states that every even number can be decomposed as the sum of two primes. Let denote the number of such prime decompositions for an even . It is known that can be bounded above by where denotes Chen's constant. It is conjectured that . In 2004, Wu showed that . We attempted to replicate his work in computing Chen's constant, and in doing so we provide an improved approximation of the Buchstab function , \begin{align*} \omega(u)=1/u, & \quad (1\leq u\leq 2), (u \omega(u))'=\omega(u-1), & \quad (u\geq 2). \end{align*} based on work done by Cheer and Goldston. For each interval , they expressed as a Taylor expansion about…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAnalytic Number Theory Research · Mathematics and Applications · History and Theory of Mathematics
