Related papers: Prime Tuples and Siegel Zeros
We settle a conjecture of Farmer and Ki in a stronger form. Roughly speaking we show that there is a positive proportion of small gaps between consecutive zeros of the zeta-function $\zeta(s)$ if and only if there is a positive proportion…
We prove that the error in the prime number theorem can be quantitatively improved beyond the Riemann Hypothesis bound by using versions of Montgomery's conjecture for the pair correlation of zeros of the Riemann zeta-function which are…
Let $S$ be a string of $l$ decimal digits. We give an explicit upper bound on some prime $p$ whose decimal representation contains the string $S$. We also show, as a corollary of the Green-Tao theorem, that there are arbitrarily long…
The bounded gaps property of the prime numbers, as proven by Yitang Zhang, is considered for sequences of lengths of closed geodesics, which by the theory of Selberg zeta functions are the geometric analogue of the prime numbers. It turns…
Let $X$ be a large parameter. We will first give a new estimate for the integral moments of primes in short intervals of the type $(p,p+h]$, where $p\leq X$ is a prime number and $h=\odi{X}$. Then we will apply this to prove that for every…
We prove two unconditional upper bounds on the gaps between ordinates of consecutive non-trivial zeros of a general $L$-function $L(s)$. This extends previous work of Hall and Hayman (2000) on the Riemann zeta-function and work of Siegel…
We show that there are sets of $n$ points in the plane with $n$ arbitrarily large that contain more than $n^{1.014}$ pairs of points separated by a distance exactly $1$. This improves on very recent work of a team at OpenAI, who proved the…
Let $\mathbf{G}$ be a reductive group defined over $\mathbb{Q}$ and let $\mathfrak{S}$ be a Siegel set in $\mathbf{G}(\mathbb{R})$. The Siegel property tells us that there are only finitely many $\gamma \in \mathbf{G}(\mathbb{Q})$ of…
We prove that among 1 and the odd zeta values $\zeta(3)$, $\zeta(5)$, \ldots, $\zeta(s)$, at least $ 0.21 \sqrt{s}/\sqrt{\log s}$ are linearly independent over the rationals, for any sufficiently large odd integer $s$. This is the first…
In this paper, we develop Furstenberg's proof of infinity of primes, and prove several results about prime divisors of sequences of integers, including the celebrated Schur's theorem. In particular, we give a simple proof of a classical…
Fix an elliptic curve E over Q. An extremal prime for E is a prime p of good reduction such that the number of rational points on E modulo p is maximal or minimal in relation to the Hasse bound. Assuming that all the symmetric power…
James Maynard has taken the analytic number theory world by storm in the last decade, proving several important and surprising theorems, resolving questions that had seemed far out of reach. He is perhaps best known for his work on small…
It is a well-known fact that for any natural number $n$, there always exists a prime in $[n, 2n]$. Our aim in this note is to generalize this result to $[n, kn]$. A lower as well as an upper bound on the number of primes in $[n, kn]$ were…
We show that both primes and smooth numbers are equidistributed in arithmetic progressions to moduli up to $x^{5/8 - o(1)}$, using triply-well-factorable weights for the primes (we also get improvements for the well-factorable linear sieve…
Let $t \in \mathbb{N}$, $\eta >0$. Suppose that $x$ is a sufficiently large real number and $q$ is a natural number with $q \leq x^{5/12-\eta}$, $q$ not a multiple of the conductor of the exceptional character $\chi^*$ (if it exists).…
We bring to bear an empirical model of the distribution of twin primes and produce two distinct results. The first is that we can make a quantitative probabilistic prediction of the occurrence of gaps in the sequence of twins within the…
Let $L_1$, $L_2$ $L_3$ be integer linear functions with no fixed prime divisor. We show there are infinitely many $n$ for which the product $L_1(n)L_2(n)L_3(n)$ has at most 7 prime factors, improving a result of Porter. We do this by means…
For a fixed exponent $0 < \theta \leq 1$, it is expected that we have the prime number theorem in short intervals $\sum_{x \leq n < x+x^\theta} \Lambda(n) \sim x^\theta$ as $x \to \infty$. From the recent zero density estimates of Guth and…
In this short paper we present an elementary proof of the infinitude of primes. Our proof is similar in spirit to Euler's proof that the reciprocals of primes diverges and only uses tools from elementary number theory and calculus. In…
The author proves that for $0.9985 < \gamma < 1$, there exist infinitely many primes $p$ such that $[p^{1/\gamma}]$ has at most 5 prime factors counted with multiplicity. This gives an improvement upon the previous results of…