On the sum of the first \(n\) prime numbers
From MaRDI portal
Publication:2198359
DOI10.5802/jtnb.1081zbMath1452.11112arXiv1409.1777OpenAlexW2985435881MaRDI QIDQ2198359
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
Related Items (6)
A sharp estimate of the discrepancy of a concatenation sequence of inversive pseudorandom numbers with consecutive primes ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Scheduling jobs with a V-shaped time-dependent processing time ⋮ Unnamed Item
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Maximal product of primes whose sum is bounded
- Fast computation of some asymptotic functional inverses
- Explicit estimates of some functions over primes
- Effective bounds for certain functions concerning prime numbers
- Approximate formulas for some functions of prime numbers
- ON THE RATIO OF THE ARITHMETIC AND GEOMETRIC MEANS OF THE PRIME NUMBERS AND THE NUMBER e
- AN ARITHMETIC EQUIVALENCE OF THE RIEMANN HYPOTHESIS
- Effective Bounds for the Maximal Order of an Element in the Symmetric Group
- On the maximal order in $S_n$ and $S*_n$
- Sharper Bounds for the Chebyshev Functions θ(x) and ψ(x)
- The 𝑘^{𝑡ℎ} prime is greater than 𝑘(ln𝑘+lnln𝑘-1) for 𝑘≥2
- New estimates for the $n$th prime number
- New estimates for some functions defined over primes
- On a sequence involving the prime numbers
- The n -th Prime is Greater than n logn
This page was built for publication: On the sum of the first \(n\) prime numbers