• Corpus ID: 7503161

The path to recent progress on small gaps between primes

@article{Goldston2007ThePT,
  title={The path to recent progress on small gaps between primes},
  author={D. A. Goldston and Janos Pintz and C. Y. Yildirim},
  journal={arXiv: Number Theory},
  year={2007}
}
We present the development of ideas which led to our recent find- ings about the existence of small gaps between primes. 

Strings of congruent primes in short intervals

  • T. Freiberg
  • Mathematics, Philosophy
    J. Lond. Math. Soc.
  • 2011
TLDR
It is proved that if (q, a )=1, then there are infinitely many pairs pr,p r+1 such that pr ≡ pr-1 ≡ a mod q and pr+1 − pr <� log pr.

TOWARDS A PROOF OF THE TWIN PRIME CONJECTURE 33

Prime numbers differing by 2 are called twin primes. The twin prime conjecture states that the number of twin primes is infinite. Many attempts to prove or disprove this 2300-year old conjecture have

An Overview of Sieve Methods

TLDR
An overview of the power of Sieve methods in number theory meant for the non-specialist is provided.

Levels of Distribution and the Affine Sieve

  • Alex Kontorovich
  • Mathematics
    Annales de la Faculté des sciences de Toulouse : Mathématiques
  • 2014
This article is an expanded version of the author's lecture in the Basic Notions Seminar at Harvard, September 2013. Our goal is a brief and introductory exposition of aspects of two topics in sieve

Three topics in additive prime number theory

This is an expository article to accompany my two lectures at the CDM conference. I have used this an excuse to make public two sets of notes I had lying around, and also to put together a short

The Goldston-Pintz-Yildirim sieveand some applications

The twin prime conjecture - that there exist infinitely many pairs of "twin primes" p, p + 2 - is among the most famous problems in number theory. In 2005, Goldston, Pintz and Yildirim (GPY) made a

The Goldston-Pintz-Yıldırım sieve and some applications

The twin prime conjecture that there exist infinitely many pairs of “twin primes” p, p + 2 is among the most famous problems in number theory. In 2005, Goldston, Pintz and Yıldırım (GPY) made a major

Small gaps between primes

AbstractCombining Goldston-Yildirim’s method on k-correlations of the truncated von Mangoldt function with Maier’s matrix method, we show that $$ \Xi _r : = \lim \inf _{n \to \infty } \tfrac{{p_{n +

Towards a Proof of the Twin Prime Conjecture

Introduction: All primes greater than or equal to five are of the form 6j –1 or 6j +1. m =1 to n ∏ Pm = Jn is the product of the first n primes. The number of (6j –1, 6j +1) pairs with no factor less

Distribution of prime numbers by the modified chi-square function

The statistical distribution of prime numbers represents an open problem in number theory still nowadays. The methodology of experimental mathematics has not yet been attempted in this field, thus

References

SHOWING 1-10 OF 41 REFERENCES

Small differences between prime numbers

  • E. BombieriH. Davenport
  • Mathematics
    Proceedings of the Royal Society of London. Series A. Mathematical and Physical Sciences
  • 1966
Let pn denote the nth prime number. The present investigation relates to the existence of relatively small values of pn+1─ pn when n is large, and establishes more precise results than those

Higher correlations of divisor sums related to primes III: k-correlations

. We obtain the general k -correlations for a short divisor sum related to primes.

On Bombieri and Davenport's theorem concerning small gaps between primes

§1. Introduction . In this paper we give a new proof of a theorem of Bombieri and Davenport [2, Theorem 1]. Let t (– k ) = t ( k ) be real, where e ( u ) = e 2 πiu . Let p and p ' denote primes, k an

Higher correlations of divisor sums related to primes III: small gaps between primes

We use divisor sums to approximate prime tuples and moments for primes in short intervals. By connecting these results to classical moment problems we are able to prove that, for any η > 0, a

Higher correlations of divisor sums related to primes I: triple correlations

We obtain the triple correlations for a truncated divisor sum related to primes. We also obtain the mixed correlations for this divisor sum when it is summed over the primes, and give some

On the second moment for primes in an arithmetic progression

Assuming the Generalized Riemann Hypothesis, we obtain a lower bound within a constant factor of the conjectured asymptotic result for the second moment for primes in an individual arithmetic

Primes in tuples I

We introduce a method for showing that there exist prime numbers which are very close together. The method depends on the level of distribution of primes in arithmetic progressions. Assuming the

Small gaps between products of two primes

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

SMALL GAPS BETWEEN PRIMES OR ALMOST PRIMES

Let p n denote the n th prime. Goldston, Pintz, and Yildirim recently proved that li m in f (pn+1 ― p n ) n→∞ log p n = 0. We give an alternative proof of this result. We also prove some

The primes contain arbitrarily long arithmetic progressions

We prove that there are arbitrarily long arithmetic progressions of primes. There are three major ingredients. The first is Szemeredi�s theorem, which asserts that any subset of the integers of