2000 character limit reached
The ternary Goldbach problem with primes in positive density sets
Published 27 Feb 2016 in math.NT | (1603.00004v1)
Abstract: Let $\mathcal{P}$ denote the set of all primes. $P_{1},P_{2},P_{3}$ are three subsets of $\mathcal{P}$. Let $\underline{\delta}(P_{i})$ $(i=1,2,3)$ denote the lower density of $P_{i}$ in $\mathcal{P}$, respectively. It is proved that if $\underline{\delta}(P_{1})>5/8$, $\underline{\delta}(P_{2})\geq5/8$, and $\underline{\delta}(P_{3})\geq5/8$, then for every sufficiently large odd integer n, there exist $p_{i} \in P_{i}$ such that $n=p_{1}+p_{2}+p_{3}$. The condition is the best possible.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.