Abstract
Let s≥2 be an integer. Denote by f 1(s) the least integer so that every integer l>f 1(s) is the sum of s distinct primes. Erdős proved that f 1(s)<p 1+p 2+⋯+p s +Cslogs, where p i is the ith prime and C is an absolute constant. In this paper, we prove that f 1(s)=p 1+p 2+⋯+p s +(1+o(1))slogs=p 2+p 3+⋯+p s+1+o(slogs). This answers a question posed by P. Erdős.
Similar content being viewed by others
References
Fang, J.H., Chen, Y.G.: On a problem of Sierpiński, arXiv:1110.4714v1 [math.NT]
Erdős, P.: On a problem of Sierpiński. Acta Arith. XI, 189–192 (1965)
Jia, C.H.: Three primes theorem in short intervals. Acta Math. Sin. 34, 832–850 (1991). (in Chinese)
Sandor, J., Mitrinovic, D.S., Crstici, B.: Handbook of Number Theory, 1st edn. p. P327. Springer, Berlin (1995)
Sierpiński, W.: Sur les suites d’entiers deux premicrs entere eux. Enseign. Math. 10, 229–235 (1964)
Statulevičius, V.: On the representation of odd numbers as the sum of three almost equal prime numbers. Vilniaus Valst. Univ. Mokslo Darbai. Mat. Fiz. Chem. Mokslu Ser. 3, 5–23 (1955)
Acknowledgement
We sincerely thank the referee for his/her substantial suggestion.
Author information
Authors and Affiliations
Corresponding author
Additional information
The authors are supported by the National Natural Science Foundation of China, Grant Nos. 11126302, 11071121. J.-H. Fang is also supported by the Natural Science Foundation of the Jiangsu Higher Education Institutions, Grant No. 11KJB110006 and the Foundation of Nanjing University of Information Science & Technology No. 20110421.
Rights and permissions
About this article
Cite this article
Fang, JH., Chen, YG. On a problem of Erdős. Ramanujan J 30, 443–446 (2013). https://doi.org/10.1007/s11139-012-9407-5
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s11139-012-9407-5