Related papers: More precise pair correlation of zeros and primes …
The Twin Prime conjecture states that there are infinitely many pairs of distinct primes which differ by $2$. Until recently this conjecture had seemed to be far out of reach with current techniques. However, in April 2013, Yitang Zhang…
A 1976 result from Norton may be used to give an asymptotic (but not explicit) description of the constant in Mertens' second theorem for primes in arithmetic progressions. Assuming the Generalized Riemann Hypothesis, we give an effective…
We address the question of the infinitude of twin and cousin prime pairs from a probabilistic perspective. Our approach partitions the set of integer numbers greater than $2$ in finite intervals of the form $[p_{n-1}^2,p_n^2)$, $p_{n-1}$…
Montgomery's pair correlation conjecture predicts the asymptotic behavior of the function $N(T,\beta)$ defined to be the number of pairs $\gamma$ and $\gamma'$ of ordinates of nontrivial zeros of the Riemann zeta-function satisfying…
We prove exact formulas for weighted $2k$th moments of the Riemann zeta function for all integer $k\geq 1$ in terms of the analytic continuation of an auto-correlation function. This latter enjoys several functional equations. One of them,…
We give a short Wiener measure proof of the Riemann hypothesis based on a surprising, unexpected and deep relation between the Riemann zeta $\zeta(s)$ and the trivial zeta $\zeta_{t}(s):=Im(s)(2Re(s)-1)$.
In this work, we prove the equivalence between the pair correlation functions of primes, and of spins in a two-dimensional (2D) Ising model with a mixture of ferromagnetic and randomly distributed competing interactions. At first, we prove…
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].
We establish limitations to how well one can mollify the Riemann zeta-function on the critical line with mollifiers of arbitrary length. Our result gives a non-trivial lower bound for the contribution of the off-diagonal terms to mollified…
We conjecture the full asymptotic expansion of a product of Riemann zeta functions, evaluated at the non-trivial zeros of the zeta function, with shifts added in each argument. By taking derivatives with respect to these shifts, we form a…
The famous Goldbach conjecture remains open for nearly three centuries. Recently Goldbach graphs are introduced to relate the problem with the literature of Graph Theory. It is shown that the connectedness of the graphs is equivalent to the…
Goldbach`s Conjecture, "every even number greater than 2 can be expressed as the sum of two primes" is renamed Goldbach`s Rule for it can not be otherwise. The conjecture is proven by showing that the existence of prime pairs adding to any…
A deep conjecture of Montgomery and Soundararajan on the distribution of prime numbers in short intervals of length $h$ says that the third moment is bounded by $\ll h^{\frac {3}{2}-c}$ for some $c>0$. There is in the literature some…
Using a smoothing function and recent knowledge on the zeros of the Riemann zeta-function, we compute pairs of $(\Delta,x_0)$ such that for all $x \geq x_0$ there exists at least one prime in the interval $(x(1 - \Delta^{-1}), x]$.
In this paper we establish a function field analogue of a conjecture in number theory which is a combination of several famous conjectures, including the Hardy-Littlewood prime tuple conjecture, conjectures on the number of primes in…
Associate a unique numerical sequence called the modular signature with each positive integer, using modular residues of each integer under the prime numbers, and distinguishing between the core seed primes and non-core seed primes used to…
We investigate progressions in the set of pairs of integers $\mathbb{Z}^2$ and define a generalisation of the Jacobsthal function. For this function, we conjecture a specific upper bound and prove that this bound would be a sufficient…
We prove that a positive proportion of the gaps between consecutive primes are short gaps of length less than any fixed fraction of the average spacing between primes.
In a recent work Friedlander studied the problem of how large consecutive prime gaps should be in order that the sum of the reciprocals should be divergent. Supposing a very deep Hypothesis, a generalization of the Hardy--Littlewood prime…
We prove that if $x$ is large enough, namely $x\ge x_0$, then there exists a prime between $x(1- \Delta^{-1})$ and $x$, where $\Delta$ is an effective constant computed in terms of $x_0$. This improves some previous results of Ramar\'e and…