Explicit estimates of some functions over primes
From MaRDI portal
Publication:1696816
DOI10.1007/s11139-016-9839-4zbMath1426.11088OpenAlexW2541924216WikidataQ56171380 ScholiaQ56171380MaRDI QIDQ1696816
Publication date: 15 February 2018
Published in: The Ramanujan Journal (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11139-016-9839-4
distribution of primesanalytic computationsChebyshev's functionsexplicit estimates of prime numbersintervals containing primes
Related Items (72)
Local boxicity ⋮ A generalization of a theorem of Sylvester and Schur ⋮ On Ramanujan primes ⋮ An explicit density estimate for Dirichlet $L$-series ⋮ On generalized Ramanujan primes ⋮ The sum of divisors function and the Riemann hypothesis ⋮ Robin's inequality for 20-free integers ⋮ Counting and effective rigidity in algebra and geometry ⋮ A LOWER BOUND ON THE NUMBER OF PRIMES BETWEEN AND n ⋮ Problems on finite automata and the exponential time hypothesis ⋮ Improved explicit bounds for some functions of prime numbers ⋮ Primary Pseudoperfect Numbers, Arithmetic Progressions, and the Erdős-Moser Equation ⋮ On SA, CA, and GA numbers ⋮ Error estimates for a class of continuous Bonse-type inequalities ⋮ On recognition of alternating groups by prime graph ⋮ A NEW UPPER BOUND FOR THE SUM OF DIVISORS FUNCTION ⋮ Unnamed Item ⋮ An inequality related to the sieve of Eratosthenes ⋮ New estimates for some integrals of functions defined over primes ⋮ Sharper bounds for the Chebyshev function \(\psi(x)\) ⋮ Some explicit estimates for the error term in the prime number theorem ⋮ Uniform hypergraphs under certain intersection constraints between hyperedges ⋮ On the counting function of semiprimes ⋮ Numerically explicit estimates for the distribution of rough numbers ⋮ On the flip graphs on perfect matchings of complete graphs and signed reversal graphs ⋮ Product of primes in arithmetic progressions ⋮ On the sum of the first \(n\) prime numbers ⋮ Packing cliques in 3‐uniform hypergraphs ⋮ Advances in additive number theory ⋮ The reciprocal sum of the amicable numbers ⋮ Coprime permutations ⋮ Products of primes in arithmetic progressions: a footnote in parity breaking ⋮ The \(n\)-th prime asymptotically ⋮ Gaps between prime numbers and tensor rank of multiplication in finite fields ⋮ On the constant factor in several related asymptotic estimates ⋮ The Erdős conjecture for primitive sets ⋮ Maximal product of primes whose sum is bounded ⋮ The error term in the prime number theorem ⋮ On the equation $\varphi (n)=\varphi (n+1)$ ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Estimates of the \(k\)th prime under the Riemann hypothesis ⋮ The Paley graph conjecture and Diophantine \(m\)-tuples ⋮ Primes between consecutive powers ⋮ Unnamed Item ⋮ Proof of the Sheldon Conjecture ⋮ New estimates for the $n$th prime number ⋮ Covering systems with restricted divisibility ⋮ New estimates for some functions defined over primes ⋮ Estimates for $\pi(x)$ for large values of $x$ and Ramanujan's prime counting inequality ⋮ Updating the error term in the prime number theorem ⋮ On groups having the prime graph as alternating and symmetric groups ⋮ Primes in (0, n vs. (n, m]] ⋮ The constant factor in the asymptotic for practical numbers ⋮ Unnamed Item ⋮ Explicit average orders: news and problems ⋮ Sums over primitive sets with a fixed number of prime factors ⋮ Higher Mertens constants for almost primes ⋮ On a variation of the Erdős–Selfridge superelliptic curve ⋮ Highly composite numbers and the Riemann hypothesis ⋮ On the product of continuous prime numbers ⋮ New results on modular Golomb rulers, optical orthogonal codes and related structures ⋮ Unnamed Item ⋮ Sharper bounds for the Chebyshev function 𝜃(𝑥) ⋮ An improvement on the perfect order subsets of finite groups ⋮ AN ARITHMETIC EQUIVALENCE OF THE RIEMANN HYPOTHESIS ⋮ The Riemann hypothesis is true up to 3·1012 ⋮ Variants on Andrica's conjecture with and without the Riemann hypothesis ⋮ Quasiperfect numbers with the same exponent ⋮ On the regularity of primes in arithmetic progressions ⋮ New results for witnesses of Robin’s criterion ⋮ A sample efficient sparse FFT for arbitrary frequency candidate sets in high dimensions
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On a constant related to the prime counting function
- Fast computation of some asymptotic functional inverses
- Short effective intervals containing primes
- Effective bounds for certain functions concerning prime numbers
- Nonnegative trigonometric polynomials and a zero-free region for the Riemann zeta-function
- Approximate formulas for some functions of prime numbers
- Estimates of $\psi ,\theta $ for large values of $x$ without the Riemann hypothesis
- On the first sign change of $\theta (x) -x$
- A zero density result for the Riemann zeta function
- An explicit density estimate for Dirichlet $L$-series
- Estimates for the Chebyshev Function ψ(x) - θ(x)
- On the Zeros of the Riemann Zeta Function in the Critical Strip. IV
- Estimation de la fonction de Tchebychef θ sur le k-ième nombre premier et grandes valeurs de la fonction ω(n) nombre de diviseurs premiers de n
- Sharper Bounds for the Chebyshev Functions θ(x) and ψ(x)
- Sharper Bounds for the Chebyshev Functions θ(x) and ψ(x). II
- Computing 𝜓(𝑥)
- The 𝑘^{𝑡ℎ} prime is greater than 𝑘(ln𝑘+lnln𝑘-1) for 𝑘≥2
- New maximal prime gaps and first occurrences
- Explicit estimates for the summatory function of \varLambda (n)ń from the one of \varLambda (n)
- New bounds for $\psi (x)$
- An improved upper bound for the error in the zero-counting formulae for Dirichlet $L$-functions and Dedekind zeta-functions
- Short effective intervals containing primes
- Une région explicite sans zéros pour la fonction ζ de Riemann
- Empirical verification of the even Goldbach conjecture and computation of prime gaps up to 4⋅10¹⁸
- Prime numbers and computer methods for factorization
- Updating the error term in the prime number theorem
This page was built for publication: Explicit estimates of some functions over primes
