On the representation of a large integer as the sum of a prime and a square-free number with at most three prime divisors
In this paper we prove that every sufficiently large odd integer can be written as a sum of a prime and 2 times a product of at most two distinct odd primes. Together with Chen’s theorem and Ross’s observation, this shows every sufficiently large integer can be written as a sum of a prime and a square-free number with at most three prime divisors.
KeywordsChen’s theorem Estermann’s theorem Sieve method
Mathematics Subject Classification11P32 11N36 11N80
The author is very grateful to Jim Brown, Luke Giberson, Kevin James, Daozhou Zhu and the reviewer for their helpful discussions and suggestions.
- 1.Chen, J.R.: On the representation of a large even integer as the sum of a prime and the product of at most two primes, Kexue Tongbao (Foreign Lang. Ed.), vol. 17, pp. 385–386 (1966)Google Scholar
- 2.Chen, J.R.: On the representation of a large even integer as the sum of a prime and the product of at most two primes. Sci. Sin. 16, 151–176 (1973)Google Scholar
- 3.Corbit, D.: Conjecture on Odd Numbers. sci.math posting (1999). http://groups-beta.google.com/group/sci.math/msg/539c96e47e3ed582?hl=en&
- 8.Helfgott, H.A.: The ternary Goldbach conjecture is true (2013). arXiv:1312.7748H
- 10.Richert, H.-E.: Selberg’s sieve with weights. In: 1969 Number Theory Institute (Proc. Sympos. Pure Math., vol. XX, State Univ. New York, Stony Brook, N.Y., 1969), pp. 287–310 (1971)Google Scholar