Short effective intervals containing primes
From MaRDI portal
Publication:1869779
DOI10.1016/S0022-314X(02)00029-XzbMath1032.11038OpenAlexW1983584861MaRDI QIDQ1869779
Olivier Ramaré, Yannick Saouter
Publication date: 28 April 2003
Published in: Journal of Number Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0022-314x(02)00029-x
Related Items
On equalities involving integrals of the logarithm of the Riemann \(\varsigma\)-function with exponential weight which are equivalent to the Riemann hypothesis, Bounds for Zeta and Primes via Fourier Analysis, Improved explicit bounds for some functions of prime numbers, Explicit interval estimates for prime numbers, On the First <em>k</em>-Ramanujan Prime, On equalities involving integrals of the logarithm of the Riemann \(\zeta\)-function and equivalent to the Riemann hypothesis, EXPLICIT ESTIMATES FOR THE DISTRIBUTION OF PRIMES, Are the hyperharmonics integral? A partial answer via the small intervals containing primes, Explicit estimates of some functions over primes, Corrigendum to ‘Explicit interval estimates for prime numbers’, Explicit Estimates: From Λ(n) in Arithmetic Progressions to Λ(n)/n, Gaps between prime numbers and tensor rank of multiplication in finite fields, The largest prime factor of Landau's function, An explicit result for primes between cubes, Numerical Verification of the Ternary Goldbach Conjecture up to 8.875·1030, Short effective intervals containing primes in arithmetic progressions and the seven cubes problem, Empirical verification of the even Goldbach conjecture and computation of prime gaps up to 4⋅10¹⁸, New bounds for $\psi (x)$, Primes between consecutive powers, New estimates for some functions defined over primes, Updating the error term in the prime number theorem, Unnamed Item, On the Riemann hypothesis and the difference between primes, Fourier optimization and prime gaps, Non-vanishing of certain cyclotomic multiple harmonic sums and application to the non-vanishing of certain p-adic cyclotomic multiple zeta values, Every odd number greater than $1$ is the sum of at most five primes
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On distinguishing prime numbers from composite numbers
- Riemann's hypothesis and tests for primality
- Fast generation of prime numbers and secure public-key cryptographic parameters.
- Verifying the Goldbach conjecture up to 4⋅10¹⁴
- The Difference Between Consecutive Primes, II
- Elliptic Curves and Primality Proving
- On the Explicit Formula of Riemann-Von Mangoldt, II
- Elementary estimates for the Chebyshev function
- On the Zeros of the Riemann Zeta Function in the Critical Strip. IV
- First Occurrence Prime Gaps
- The Pseudoprimes to 25 ⋅10 9
- Sharper Bounds for the Chebyshev Functions θ(x) and ψ(x)
- The large sieve
- New Primality Criteria and Factorizations of 2 m ± 1
- Sharper Bounds for the Chebyshev Functions θ(x) and ψ(x). II
- New maximal prime gaps and first occurrences
- On Strong Pseudoprimes to Several Bases
- Checking the odd Goldbach conjecture up to 10²⁰
- Explicit Bounds for Some Functions of Prime Numbers