# Small gaps between products of two primes

```@article{Goldston2009SmallGB,
title={Small gaps between products of two primes},
author={D. A. Goldston and Sidney W. Graham and Janos Pintz and C. Y. Yildirim},
journal={Proceedings of the London Mathematical Society},
year={2009},
volume={98}
}```
• Published 21 September 2006
• Mathematics
• Proceedings of the London Mathematical Society
Let qn denote the nth number that is a product of exactly two distinct primes. We prove that qn+1 − qn ⩽ 6 infinitely often. This sharpens an earlier result of the authors, which had 26 in place of 6. More generally, we prove that if ν is any positive integer, then (qn+ν − qn) ⩽ ν eν − γ (1+o(1)) infinitely often. We also prove several other related results on the representation of numbers with exactly two prime factors by linear forms.
Small Gaps Between Almost Primes, the Parity Problem, and Some Conjectures of Erdős on Consecutive Integers
• Mathematics
• 2010
In a previous paper, the authors proved that in any system of three linear forms satisfying obvious necessary local conditions, there are at least two forms that infinitely often assume E 2 -values;
Small gaps between three almost primes and almost prime powers
• Mathematics
Acta Arithmetica
• 2022
A positive integer is called an Ej -number if it is the product of j distinct primes. We prove that there are infinitely many triples of E2-numbers within a gap size of 32 and infinitely many triples
Correlations of Almost Primes
. We prove that analogues of the Hardy-Littlewood generalised twin prime conjecture for almost primes hold on average. Our main theorem establishes an asymptotic formula for the number of integers n
On the Residue Classes of π(n) Modulo t
• Mathematics
Integers
• 2013
Using Selberg’s sieve, this work proves a positive lower bound for the proportion of positive integers n such that π(n) is r mod t for any fixed integers r and t.
Bounded Gaps between Products of Special Primes
• Mathematics
• 2014
In their breakthrough paper in 2006, Goldston, Graham, Pintz and Yildirim proved several results about bounded gaps between products of two distinct primes. Frank Thorne expanded on this result,
Small gaps between primes
We introduce a renement of the GPY sieve method for studying prime k-tuples and small gaps between primes. This renement avoids previous limitations of the method and allows us to show that for each
On the gap between primes
. It is proven that there are inﬁnitely many pairs of distinct primes whose diﬀerence is no greater than 130. In proving that result, a new sieve weight is constructed. The new idea in the
Bounded gaps between products of primes with applications to ideal class groups and elliptic curves
In their recent papers, Goldston, Graham, Pintz, and Yildirim [12, 13] use a variant of the Selberg sieve to prove the existence of small gaps between E 2 numbers, that is, square-free numbers with
The existence of small prime gaps in subsets of the integers
We consider the problem of finding small prime gaps in various sets . Following the work of Goldston–Pintz–Yildirim, we will consider collections of natural numbers that are well-controlled in