Related papers: Analytic implication from the prime number theorem
Let $\chi$ be a real and non-principal Dirichlet character, $L(s,\chi)$ its Dirichlet $L$-function and let $p$ be a generic prime number. We prove the following result: If for some $0\leq \sigma<1$ the partial sums $\sum_{p\leq…
The prime number theorem, established by Hadamard and de la Vall'ee Poussin independently in 1896, asserts that the density of primes in the positive integers is asymptotic to 1 / ln x. Whereas their proofs made serious use of the methods…
Let $R$ be a commutative ring and $n\geq1$ and $p\geq0$ two integers. Let $h_{k,\ i}$ be an element of $R$ for all $k\in\mathbb Z$ and $i\in [n]$. For any $\alpha\in\mathbb Z^n$, we define \[ t_{\alpha}:=\det\begin{pmatrix} h_{\alpha_1+1,\…
Write $T(n)$ as the sum of the reciprocals of the primes which divide $n$. Write $H(n) = \prod_{p|n}p/(p-1)$ where the product is over the prime divisors of $n$. We prove new bounds for $T(n)$ and $H(n)$ in terms of the smallest prime…
The Green-Tao-Ziegler theorem provides asymptotics for the number of prime tuples of the form $(\psi_1(n),\ldots,\psi_t(n))$ when $n$ ranges among the integer vectors of a convex body $K\subset [-N,N]^d$ and $\Psi=(\psi_1,\ldots,\psi_t)$ is…
Instead of a strong quantitative form of the Hardy-Littlewood prime $k$-tuple conjecture, one can assume an average form of it and still obtains the same distribution result on $\psi(x+h) - \psi(x)$ by Montgomery and Soundararajan [1].
Let $\psi$ be a positive function defined near the origin such that $\lim_{t\to 0^{+}}\psi(t)=0$. We consider the operator \begin{equation*} T_\theta f(x) = \lim_{\varepsilon\to 0^+} \int_\varepsilon^1 e^{i\gamma(t)}f(x-t)…
We show that there exists a positive arithmetical formula $\psi(x,R)$, where $x \in \omega$, $R \subseteq \omega$, with no hyperarithmetical fixed point. This answers a question of Gerhard J\"{a}ger. As corollaries we obtain results on the…
Suppose l=2m+1, m>0. We introduce m "theta-series", [1],...,[m], in Z/2[[x]]. It has been conjectured that the n for which the coefficient of x^n in 1/[i] is 1 form a set of density 0. This is probably always false, but in certain cases,…
Motivated by the connection to the pair correlation of the Riemann zeros, we investigate the second derivative of the logarithm of the Riemann zeta function, in particular the zeros of this function. Theorem 1 gives a zero-free region.…
Standard prime-number counting functions, such as $\psi(x)$, $\theta(x)$, and $\pi(x)$, have error terms with limiting logarithmic distributions once suitably normalized. The same is true of weighted versions of those sums, like $\pi_r(x) =…
Contrary to what would be predicted on the basis of Cram\'er's model concerning the distribution of prime numbers, we develop evidence that the distribution of $\psi(x+H)- \psi(x)$, for $0\le x\le N$, is approximately normal with mean $\sim…
Let $\tau(n)$ be Ramanujan's tau function, defined by the discriminant modular form \[ \Delta(z) = q\prod_{j=1}^{\infty}(1-q^{j})^{24}\ =\ \sum_{n=1}^{\infty}\tau(n) q^n \,,q=e^{2\pi i z} \] (this is the unique holomorphic normalized…
We prove that given $\lambda \in \mathbb{R}$ such that $0 < \lambda < 1$, then $\pi(x + x^\lambda) - \pi(x) \sim \displaystyle \frac{x^\lambda}{\log(x)}$. This solves a long-standing problem concerning the existence of primes in short…
Hiary [3] has presented an algorithm which allows to evaluate the truncated theta function $\sum_{k=0}^n \exp(2\pi \i (zk+\tau k^2))$ to within $\pm \epsilon$ in $O(\ln(\tfrac{n}{\epsilon})^{\kappa})$ arithmetic operations for any real $z$…
In this article we provide new explicit Chebyshev's bounds for the prime counting function $\psi(x)$. The proof relies on two new arguments: smoothing the prime counting function which allows to generalize the previous approaches, and a new…
Let $f(z)=\sum_{n=1}^\infty a(n)e^{2\pi i nz}\in S_k^{new}(\Gamma_0(N))$ be a newform of even weight $k\geq2$ that does not have complex multiplication. Then $a(n)\in\mathbb{R}$ for all $n$, so for any prime $p$, there exists…
In 1874, Mertens proved the approximate formula for partial Euler product for Riemann zeta function at $s=1$, which is called Mertens' theorem. In this paper, we generalize Mertens' theorem for Selberg class and show the prime number…
The results of the study provide guidelines for the development and applications of algorithms. When the number of steps for calculating an assumption tends to infinity, probability theory can be applied to predict whether the assumption…
In this note we examine Littlewood's proof of the prime number theorem. We show that this can be extended to provide an equivalence between the prime number theorem and the non-vanishing of Riemann's zeta-function on the one-line. Our…