Related papers: The prime number theorem for primes in arithmetic …

Let $\pi_{q,a}(x)$ denote the number of primes $\le x$ in the progression $a$ modulo $q$. We study subtle inequities in these functions, with $q$ fixed and variable $a$ (sometimes called 'prime race problems'). It is known unconditionally…

We give the converse to Dirichlet's theorem on primes in arithmetic progressions by generalizing an old result of Guinand.

An improved estimate is given for $|\theta(x) -x|$, where $\theta(x) = \sum_{p\leq x} \log p$. Three applications are given: the first to arithmetic progressions that have points in common, the second to primes in short intervals, and the…

We continue investigations on the average number of representations of a large positive integer as a sum of given powers of prime numbers. The average is taken over a short interval, whose admissible length depends on whether or not we…

In this paper, we develop a novel analytic method to prove the prime number theorem in de la Vall\'ee Poussin's form: $$ \pi(x)=\operatorname{li}(x)+\mathcal O(xe^{-c\sqrt{\log x}}) $$ Instead of performing asymptotic expansion on Chebyshev…

We prove an explicit upper bound of the function $S(t,\chi)$, defined by the argument of Dirichlet $L$-functions. An explicit upper bound of the function $S_1(t)$, defined by the integral of the argument of the Riemann zeta-function, have…

Under the generalized Riemann hypothesis, we use Beurling-Selberg extremal functions to bound the mean and mean square of the argument of Dirichlet $L$-functions to a large prime modulus $q$. As applications, we give alternative proofs of…

This paper is devoted to the theory of prime numbers. In this paper we first introduce the notion of a matrix of prime numbers. Then, in order to investigate the density of prime numbers in separate rows of the matrix under consideration,…

For a given Dirichlet character $\chi (n) = e^{i \theta_n}$, we prove central limit theorems for the series $\sum_{p'} \cos \theta_{p'}$ for non-principal characters, and $\sum_{p' } \cos (t \log p')$ for principal characters, where $p'$…

We prove that there are arbitrarily long arithmetic progressions of primes. There are three major ingredients. The first is Szemeredi's theorem, which asserts that any subset of the integers of positive density contains progressions of…

Assume the Riemann hypothesis throughout. We obtain some new estimates for the size of the set of large values of the error term in the prime number theorem. Our argument is based on an analysis of the behavior of zeros of the Riemann zeta…

We show that the existence of arithmetic progressions with few primes, with a quantitative bound on "few", implies the existence of larger gaps between primes less than x than is currently known unconditionally. In particular, we derive…

We study the average distribution of primes of size $x$ in arithmetic progressions to moduli larger than $x^{\frac{1}{2}}$. Using arithmetic information from the works of many authors together with different variants of the original…

By using Beta Dirichlet series and then Eisenstein series we ca represent primes with first a good approximation and an exact expression. This can be done with arbitrary prime (up to 10^101).

We survey the classical results on the prime number theorem

In this paper we establish function field versions of two classical conjectures on prime numbers. The first says that the number of primes in intervals (x,x+x^epsilon] is about x^epsilon/log x and the second says that the number of primes…

We give explicit numerical values with 100 decimal digits for the constant in the Mertens product over primes in the arithmetic progressions $a \bmod q$, for $q \in \{3$, ..., $100\}$ and $(a, q) = 1$.

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…

It is well known that the distribution of the prime numbers plays a central role in number theory. It has been known, since Riemann's memoir in 1860, that the distribution of prime numbers can be described by the zero-free region of the…

Assuming the Generalized Riemann Hypothesis, we establish explicit bounds in the $q$-aspect for the logarithmic derivative $\left(L'/L\right)\left(\sigma,\chi\right)$ of Dirichlet $L$-functions, where $\chi$ is a primitive character modulo…