Related papers: The error term in the prime number theorem

In this article, we study the Piltz divisor problem, which is sometimes called the generalized Dirichlet divisor problem, over number fields. We establish an identity akin to Vorono\"i's formula concerning the error term in the Dirichlet…

We strengthen the recent result of Cherubini and Guerreiro on the square mean of the error term in the prime geodesic theorem for $\mathrm{PSL}_2(\mathbb{Z})$. We also develop a short interval version of this result.

We furnish an explicit bound for the prime number theorem in short intervals on the assumption of the Riemann hypothesis.

In this paper we present a short and elementary proof for the error in Simpson's rule.

We have devised an alternative approach to sifting integers in the sieve of Eratosthenes that helps refine the error term. Instead of eliminating all multiples of a prime number $p<z$ in the traditional sieve method, our approach solely…

It is the purpose of this thesis to enunciate and prove a collection of explicit results in the theory of prime numbers. First, the problem of primes in short intervals is considered. We prove that there is a prime between consecutive cubes…

We consider the upper bound of Piltz divisor problem over number fields. Piltz divisor problem is known as a generalization of the Dirichlet divisor problem. We deal with this problem over number fields and improve the error term of this…

Under the Riemann Hypothesis, we improve the error term in the asymptotic formula related to the counting lattice problem studied in a first part of this work. The improvement comes from the use of Weyl's bound for exponential sums of…

The first result of our article is another proof of Mertens' third theorem in the number field setting, which generalises a method of Hardy. The second result concerns the sign of the error term in Mertens' third theorem. Diamond and Pintz…

The theory of Mellin transform is an incredibly useful tool in evaluating some of the well known results for the zeta function. Ramanujan in his quarterly reports \cite{1} gave a theorem for Mellin transform which is now known as…

Comparative prime number theory is the study of the {\em{discrepancies}} of distributions when we compare the number of primes in different residue classes. This work presents a list of the problems being investigated in comparative prime…

Numerical study of the distribution of the Riemann zeros differences following the work [1] shows the significance of the function for which the prime sum expression is proposed. Computational results related to this definition explored…

Let $\sigma+i\gamma$ be a zero of the Riemann zeta function to the right of the line $\frac{1}{2}+it$. We show that this zero causes large oscillations of the error term of the prime number theorem. Our result is close to optimal both in…

We establish an error term in the Sato-Tate theorem of Birch. That is, for $p$ prime, $q=p^r$ we show that $\#\{ (a,b) \in \mathbb{F}_q^2 : \theta_{a,b}\in I\} =\mu_{ST}(I)q^2 + O_r(q^{7/4})$ for any interval $I\subseteq[0,\pi]$ where for…

We give a new elementary proof of Landau's Prime Ideal Theorem. The proof is an extension of Richter's proof of the Prime Number Theorem. The main result contains other results related to the equidistribution of the prime ideal counting…

In the paper, the occurrence of zeros and ones in the binary expansion of the primes is studied. In particular the statement in the title is established. The proof is unconditional.

In this paper, we establish the irrationality of some open problems in mathematics based on using a recursive formula that generate the complete sequence of numbers. see [1] But before getting into that we begin with some Ramanujan notable…

In this lecture notes we try to familiarize the audience with the theory of Bernoulli polynomials; we study their properties, and we give, with proofs and references, some of the most relevant results related to them. Several applications…

Explicit formulas involving a generalized Ramanujan sum are derived. An analogue of the prime number theorem is obtained and equivalences of the Riemann hypothesis are shown. Finally, explicit formulas of Bartz are generalized.

For $i\in \{1,2,3\}$, let $E_i(x)$ denote the error term in each of the three theorems of Mertens on the asymptotic distribution of prime numbers. We show that for $i\in \{1,2\}$ the Riemann hypothesis is equivalent to the condition…