Related papers: The error term in the prime number theorem

We present an elementary proof of the prime number theorem. The relative error follows a golden ratio scaling law and respects the bound obtained from the Riemann's hypothesis. The proof is derived in the framework of a scale free…

A highly strong upper estimate in the modified asymptotic formula for sums of the primes' reciprocals is proved to be necessary (as well as sufficient) in order the Ramanujan inequality holds true. Some other criteria in similar terms are…

This is an exposition, in 12 pages including all prerequisites and a generalization, of Karamata's little known elementary proof of the Landau-Ingham Tauberian theorem, a result in real analysis from which the Prime Number Theorem follows…

The main goal of this article is to present several quadratic refinements and reverses of the well known Heinz inequality, for numbers and matrices, where the refining term is a quadratic function in the mean parameters. The proposed idea…

We give an elementary proof for new strict upper and lower bounds for the correction term in Ramanujan's approximation for the factorial function

We give a new proof of the best presently known error term in the prime geodesic theorem for compact Riemann surfaces, without the assumption of excluding a set of finite logarithmic measure. Stronger implications of the Gallagher-Koyama…

We present a detailed proof of the prime number theorem suitable for a typical undergraduate- or graduate-level complex analysis course. Our presentation is particularly useful for any instructor who seeks to use the prime number theorem…

We prove an effective version of the Oppenheim conjecture with a polynomial error rate. The proof is based on an effective equidistribution theorem which in turn relies on recent progress towards restricted projection problem.

Asymptotic study on the partition function $p(n)$ began with the work of Hardy and Ramanujan. Later Rademacher obtained a convergent series for $p(n)$ and an error bound was given by Lehmer. Despite having this, a full asymptotic expansion…

We give two improved explicit versions of the prime number theorem for primes in arithmetic progression: the first isolating the contribution of the Siegel zero and the second completely explicit, where the improvement is for medium-sized…

We prove two results, generalizing long existing knowledge regarding the classical case of the Riemann zeta function and some of its generalizations. These are concerned with the question of Ingham who asked for optimal and explicit order…

In this paper we study some improvements of the classical Hardy inequality. We add to the right hand side of the inequality a term which depends on some Lorentz norms of $u$ or of its gradient and we find the best values of the constants…

We present a self-contained elementary and detailed exposition of Mertens' own proof of his theorem on the divergence of the series of the reciprocals of the primes and compare it with the modern proofs. His proof contains explicit…

To determine whether a number is congruent or not is an old and difficult topic and progress is slow. The paper presents a new theorem when a prime number is a congruent number or not. The proof is not necessarily any simpler or shorter…

An error in the proof of Bell's Theorem is identified and a semiclassical model of the EPRB experiment is presented

Assuming the Riemann hypothesis, we prove the latest explicit version of the prime number theorem for short intervals. Using this result, and assuming the generalised Riemann hypothesis for Dirichlet $L$-functions is true, we then establish…

Error bounds have been studied for more than seventy years, beginning with the seminal result of Hoffman (1952) [{\it J. Res. Natl. Bur. Standards}, 49 (1952), 263--265], which establishes an upper bound for the distance from an arbitrary…

In 1980 Montgomery made a conjecture about the true order of the error term in the prime number theorem. In 2012 the author made an analogous conjecture for the true order of the sum of the M\"{o}bius function, $M(x)$. This refined an…

We investigate some extremal problems in Fourier analysis and their connection to a problem in prime number theory. In particular, we improve the current bounds for the largest possible gap between consecutive primes assuming the Riemann…

In 1915, Ramanujan proved asymptotic inequalities for the sum of divisors function, assuming the Riemann hypothesis (RH). We consider a strong version of Ramanujan's theorem and define highest abundant numbers that are extreme with respect…