On the sum of the first n prime numbers

DOI10.5802/JTNB.1081MaRDI QIDQ2198359zbMATH OpenOpenAlexFDO

Authors Christian Axler

Publication date 10 September 2020

Published in Journal de Théorie des Nombres de Bordeaux (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1409.1777

zbMATH Keywords

asymptotic expansion Mandl's inequality sum of prime numbers

Mathematics Subject Classification ID

Distribution of primes (11N05) Primes (11A41)

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.

Recommendations

Inequalities and asymptotic formulas for sums of prime powers
On a family of functions defined over sums of primes
Comportement Asymptotique de
On a sequence involving prime numbers
Sums of powers of primes

Cites work

scientific article; zbMATH DE number 4069000 (Why is no real title available?)
scientific article; zbMATH DE number 3523640 (Why is no real title available?)
An arithmetic equivalence of the Riemann hypothesis
Approximate formulas for some functions of prime numbers
Effective Bounds for the Maximal Order of an Element in the Symmetric Group
Effective bounds for certain functions concerning prime numbers
Explicit estimates of some functions over primes
Fast computation of some asymptotic functional inverses
Maximal product of primes whose sum is bounded
New estimates for some functions defined over primes
New estimates for the $n$th prime number
On a family of functions defined over sums of primes
On a sequence involving prime numbers
On the maximal order in $S_n$ and $S*_n$
On the ratio of the arithmetic and geometric means of the prime numbers and the number $e$
Sharper Bounds for the Chebyshev Functions θ(x) and ψ(x)
The n -th Prime is Greater than n logn
The 𝑘^{𝑡ℎ} prime is greater than 𝑘(ln𝑘+lnln𝑘-1) for 𝑘≥2

Cited in

(10)

On a family of functions defined over sums of primes
Scheduling jobs with a V-shaped time-dependent processing time
ON THE SUM OF THE FIRST n PRIMES
On P. Mandl's inequality
A sharp estimate of the discrepancy of a concatenation sequence of inversive pseudorandom numbers with consecutive primes
Sums of powers of primes in arithmetic progression
Some D-finite and some possibly D-finite sequences in the OEIS
On the arithmetic and geometric means of the first $n$ prime numbers
Carleman's inequality over prime numbers
Mythical numbers

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)