Related papers: The error term in the prime number theorem

In the recent preprint [3], Goldston, Pintz, and Y{\i}ld{\i}r{\i}m established, among other things, $$ \liminf_{n\to\infty}{p_{n+1}-p_n\over\log p_n}=0,\leqno(0) $$ with $p_n$ the $n$th prime. In the present article, which is essentially…

In this expository article we provide an elegant proof of the one-sided Ingham-Karamata Tauberian theorem. As an application, we present a short deduction of the prime number theorem.

In this article, we obtain upper bounds on the number of irreducible factors of some classes of polynomials having integer coefficients, which in particular yield some of the well known irreducibility criteria. For devising our results, we…

This short note provides a sharper upper bound of a well known inequality for the sum of divisors function. This is a problem in pure mathematics related to the distribution of prime numbers. Furthermore, the technique is completely…

We prove the analog of Cram\'er's short intervals theorem for primes in arithmetic progressions and prime ideals, under the relevant Riemann Hypothesis. Both results are uniform in the data of the underlying structure. Our approach is based…

We prove sharp, computable error estimates for the propagation of errors in the numerical solution of ordinary differential equations. The new estimates extend previous estimates of the influence of data errors and discretisation errors…

The problem of the least prime number in an arithmetic progression is one of the most important topics in Number Theory. In [11], we are the first to study the relations between this problem and Goldbach's conjecture. In this paper, we…

We prove an explicit error term for the $\psi(x,\chi)$ function assuming the Generalized Riemann Hypothesis. Using this estimate, we prove a conditional explicit bound for the number of primes in arithmetic progressions.

In this note, it is shown that the Ramanujan Master Theorem (RMT) when n is a positive integer can be obtained, as a special case, from a new integral formula. Furthermore, we give a simple proof of the RMT when n is not an integer.

We show how the error term for the Trapezium Rule can be estimated, by solving an initial value problem using a Runge-Kutta method. The error term can then be added to the Trapezium approximation, yielding a much more accurate result. We…

In this paper, we first derive an inequality involving central moments for n real numbers, which in turn provides an extension of Theorem 2.2 of Wolkowicz and Styan [18]. Furthermore, we present refinements of various inequalities obtained…

Continuing previous study of the Beurling zeta function, here we prove two results, generalizing long existing knowledge regarding the classical case of the Riemann zeta function and some of its generalizations. First, we address the…

The prime number problem falls within the realm of number theory, specifically elementary number theory. Current research approaches have unnecessarily complicated this matter. In contrast to more advanced mathematical tools, the methods of…

Let $\|\cdot\|$ denote the minimum distance to an integer. For $0<\gamma< 1$, $\theta>0$ and $(\alpha, \beta) \in \mathbb{R} \setminus \{0\} \times \mathbb{R}$ we study when \begin{equation*} \|\alpha p^{\gamma}+\beta \|<p^{-\theta},…

Ramanujan's Master Theorem is a decades-old theorem in the theory of Mellin transforms which has wide applications in both mathematics and high energy physics. The unconventional method of Ramanujan in his proof of the theorem left…

In recent work, we considered the frequencies of patterns of consecutive primes $\pmod{q}$ and numerically found biases toward certain patterns and against others. We made a conjecture explaining these biases, the dominant factor in which…

A new elementary proof of the prime number theorem presented recently in the framework of a scale invariant extension of the ordinary analysis is re-examined and clarified further. Both the formalism and proof are presented in a much more…

In this note we prove an inequality involving primes and the product of consecutive primes.

This research article provides an unconditional proof of an inequality proposed by Srinivasa Ramanujan involving the Prime Counting Function $\pi(x)$, \begin{align*} (\pi(x))^{2}<\frac{ex}{\log x}\pi\left(\frac{x}{e}\right) \end{align*} for…

We prove the Ribenboim hypothesis, which states that if, starting from some integer $N$, consecutive prime numbers $p_ {n}$, $p_{n+1}$ satisfy the inequality $\sqrt {p_ {n+1}}-\sqrt{p_{n}} <1$, then the Landau problem # 4 (1912) has a…