On the sum of the first n prime numbers
From MaRDI portal
Publication:2198359
DOI10.5802/JTNB.1081zbMATH Open1452.11112arXiv1409.1777OpenAlexW2985435881MaRDI QIDQ2198359FDOQ2198359
Authors: Christian Axler
Publication date: 10 September 2020
Published in: Journal de Théorie des Nombres de Bordeaux (Search for Journal in Brave)
Abstract: In this paper we establish a general asymptotic formula for the sum of the first n prime numbers, which leads to a generalization of the most accurate asymptotic formula given by Massias and Robin in 1996.
Full work available at URL: https://arxiv.org/abs/1409.1777
Recommendations
Cites Work
- Title not available (Why is that?)
- Approximate formulas for some functions of prime numbers
- The 𝑘^{𝑡ℎ} prime is greater than 𝑘(ln𝑘+lnln𝑘-1) for 𝑘≥2
- Sharper Bounds for the Chebyshev Functions θ(x) and ψ(x)
- Effective Bounds for the Maximal Order of an Element in the Symmetric Group
- On the maximal order in $S_n$ and $S*_n$
- The n -th Prime is Greater than n logn
- An arithmetic equivalence of the Riemann hypothesis
- Fast computation of some asymptotic functional inverses
- Title not available (Why is that?)
- Explicit estimates of some functions over primes
- Maximal product of primes whose sum is bounded
- On the ratio of the arithmetic and geometric means of the prime numbers and the number \(e\)
- On a sequence involving prime numbers
- New estimates for the \(n\)th prime number
- Effective bounds for certain functions concerning prime numbers
- New estimates for some functions defined over primes
- On a family of functions defined over sums of primes
Cited In (10)
- ON THE SUM OF THE FIRST n PRIMES
- Some D-finite and some possibly D-finite sequences in the OEIS
- On P. Mandl's inequality
- On the arithmetic and geometric means of the first \(n\) prime numbers
- Scheduling jobs with a V-shaped time-dependent processing time
- Mythical numbers
- Carleman's inequality over prime numbers
- On a family of functions defined over sums of primes
- Sums of powers of primes in arithmetic progression
- A sharp estimate of the discrepancy of a concatenation sequence of inversive pseudorandom numbers with consecutive primes
This page was built for publication: On the sum of the first \(n\) prime numbers
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2198359)