The exceptional set of Goldbach problem and Linnik's constant
Genheng Zhao

TL;DR
This paper establishes an upper bound on the number of even integers not expressible as the sum of two primes and provides bounds related to the least prime in arithmetic progressions, advancing understanding of Goldbach's conjecture.
Contribution
It introduces new bounds for the exceptional set in Goldbach's problem and for the least prime in arithmetic progressions, using novel analytic techniques.
Findings
E(X)=O(X^{7/10}) for the exceptional set
P(q)=O(q^5) for the least prime in progressions
Ineffective constants in bounds
Abstract
Let denote the number of even integers below which are not a sum of two primes. We prove the bound , where the implicit constant is ineffective. The method applied here also leads to , where denotes the least prime, if it exists, in any arithmetic progression modulo .
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 · Limits and Structures in Graph Theory · Advanced Mathematical Identities
