2000 character limit reached
On the asymptotic expansion of the sum of the first n primes
Published 7 Nov 2010 in math.NT | (1011.1667v2)
Abstract: An asymptotic formula for the sum of the first n primes is derived. This result improves the previous results of P. Dusart. Using this asymptotic expansion, we prove the conjectures of R. Mandl and G. Robin on the upper and the lower bound of the sum of the first n primes respectively.
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.