Erdős considered the second moment of the gap-counting function of prime divisors in 1946 and proved an upper bound that is not of the right order of magnitude. We prove asymptotics for all moments. Furthermore, we prove a generalisation stating that the gaps between primes p for which there is no Qp -point on a random variety are Poisson distributed
In their breakthrough paper in 2006, Goldston, Graham, Pintz and Yıldırım proved several results abo...
In their breakthrough paper in 2006, Goldston, Graham, Pintz and Yıldırım proved several results abo...
We develop machinery to explicitly determine, in many instances, when the difference $x^2-y^n$ is di...
Erd\H{o}s considered the second moment of the gap-counting function of prime divisors in 1946 and pr...
We introduce a new probabilistic model of the primes consisting of integers that survive the sieving...
In the present work we prove a common generalization of Maynard- Tao’s recent result about consecuti...
We show that the existence of arithmetic progressions with few primes, with a quantitative bound on ...
We prove a couple of related theorems including Legendre’s and Andrica’s conjecture. Key to the proo...
In this dissertation we consider the problem of finding small prime gaps in various sets $\mathcal{C...
In this dissertation we consider the problem of finding small prime gaps in various sets $\mathcal{C...
The distribution of the prime numbers has intrigued number theorists for centuries. As our understan...
Let r ≥ 2 be an integer. We adapt the Maynard–Tao sieve to produce the asymptotically best-known bou...
In their breakthrough paper in 2006, Goldston, Graham, Pintz and Yıldırım proved several results abo...
ABSTRACT. Let G(X) denote the size of the largest gap between consecutive primes below X. Answering ...
Cut the unit circle \(S^1 = \mathbb{R}/\mathbb{Z}\) at the points \(\{\sqrt{1}\}, \{\sqrt{2}\}, . . ...
In their breakthrough paper in 2006, Goldston, Graham, Pintz and Yıldırım proved several results abo...
In their breakthrough paper in 2006, Goldston, Graham, Pintz and Yıldırım proved several results abo...
We develop machinery to explicitly determine, in many instances, when the difference $x^2-y^n$ is di...
Erd\H{o}s considered the second moment of the gap-counting function of prime divisors in 1946 and pr...
We introduce a new probabilistic model of the primes consisting of integers that survive the sieving...
In the present work we prove a common generalization of Maynard- Tao’s recent result about consecuti...
We show that the existence of arithmetic progressions with few primes, with a quantitative bound on ...
We prove a couple of related theorems including Legendre’s and Andrica’s conjecture. Key to the proo...
In this dissertation we consider the problem of finding small prime gaps in various sets $\mathcal{C...
In this dissertation we consider the problem of finding small prime gaps in various sets $\mathcal{C...
The distribution of the prime numbers has intrigued number theorists for centuries. As our understan...
Let r ≥ 2 be an integer. We adapt the Maynard–Tao sieve to produce the asymptotically best-known bou...
In their breakthrough paper in 2006, Goldston, Graham, Pintz and Yıldırım proved several results abo...
ABSTRACT. Let G(X) denote the size of the largest gap between consecutive primes below X. Answering ...
Cut the unit circle \(S^1 = \mathbb{R}/\mathbb{Z}\) at the points \(\{\sqrt{1}\}, \{\sqrt{2}\}, . . ...
In their breakthrough paper in 2006, Goldston, Graham, Pintz and Yıldırım proved several results abo...
In their breakthrough paper in 2006, Goldston, Graham, Pintz and Yıldırım proved several results abo...
We develop machinery to explicitly determine, in many instances, when the difference $x^2-y^n$ is di...
DOI
Add to ORKG