Explicit estimates of some functions over primes

From MaRDI portal
Publication:1696816


DOI10.1007/s11139-016-9839-4zbMath1426.11088WikidataQ56171380 ScholiaQ56171380MaRDI QIDQ1696816

Pierre Dusart

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


11N05: Distribution of primes

11A41: Primes

11Y35: Analytic computations


Related Items

Primary Pseudoperfect Numbers, Arithmetic Progressions, and the Erdős-Moser Equation, A NEW UPPER BOUND FOR THE SUM OF DIVISORS FUNCTION, The reciprocal sum of the amicable numbers, Products of primes in arithmetic progressions: a footnote in parity breaking, On the constant factor in several related asymptotic estimates, The Erdős conjecture for primitive sets, Unnamed Item, Unnamed Item, Unnamed Item, Unnamed Item, On groups having the prime graph as alternating and symmetric groups, Primes in (0, n vs. (n, m]], 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 𝜃(𝑥), The Riemann hypothesis is true up to 3·1012, New results for witnesses of Robin’s criterion, Robin's inequality for 20-free integers, A LOWER BOUND ON THE NUMBER OF PRIMES BETWEEN AND n, Error estimates for a class of continuous Bonse-type inequalities, On the flip graphs on perfect matchings of complete graphs and signed reversal graphs, Product of primes in arithmetic progressions, Coprime permutations, The error term in the prime number theorem, On the equation $\varphi (n)=\varphi (n+1)$, Proof of the Sheldon Conjecture, 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, On a variation of the Erdős–Selfridge superelliptic curve, Quasiperfect numbers with the same exponent, On the regularity of primes in arithmetic progressions, New estimates for the $n$th prime number, New estimates for some functions defined over primes, Estimates for $\pi(x)$ for large values of $x$ and Ramanujan's prime counting inequality, Primes between consecutive powers, Updating the error term in the prime number theorem, 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, Numerically explicit estimates for the distribution of rough numbers, Packing cliques in 3‐uniform hypergraphs, Advances in additive number theory, Maximal product of primes whose sum is bounded, On Ramanujan primes, Counting and effective rigidity in algebra and geometry, Problems on finite automata and the exponential time hypothesis, Improved explicit bounds for some functions of prime numbers, On recognition of alternating groups by prime graph, Gaps between prime numbers and tensor rank of multiplication in finite fields, On SA, CA, and GA numbers, Estimates of the \(k\)th prime under the Riemann hypothesis, The Paley graph conjecture and Diophantine \(m\)-tuples, Higher Mertens constants for almost primes, Highly composite numbers and the Riemann hypothesis, An improvement on the perfect order subsets of finite groups, A sample efficient sparse FFT for arbitrary frequency candidate sets in high dimensions, Local boxicity, A generalization of a theorem of Sylvester and Schur, The sum of divisors function and the Riemann hypothesis, On the sum of the first \(n\) prime numbers, Covering systems with restricted divisibility, Variants on Andrica's conjecture with and without the Riemann hypothesis, The \(n\)-th prime asymptotically, On generalized Ramanujan primes, AN ARITHMETIC EQUIVALENCE OF THE RIEMANN HYPOTHESIS, An explicit density estimate for Dirichlet $L$-series, On the counting function of semiprimes


Uses Software


Cites Work