Type: Article
Publication Date: 1992-11-01
Citations: 44
DOI: https://doi.org/10.2140/pjm.1992.156.45
It was proved by Vinogradov that every sufficiently large odd integer can be written as the sum of three primes.We show that this remains the case when the primes so utilized are restricted to an explicit thin set.One may take, for example, the "Piatetski-Shapiro primes" p = [n ι l γ ] with any γ > 20/21.By a similar argument it would follow that, for arbitrary θ, 0 < θ < 1, and suitable λ = λ(θ) > 0, one may take the set of primes for which {p θ } < p~λ .