Dirichlet's theorem on primes in arithmetic progressions: Difference between revisions

From Number
(Created page with '{{infinitude fact}} ==Statement== Let <math>a,D</math> be relatively prime natural numbers. Then, there exist infinitely many primes <math>p</math> such that: <math>p \equiv a...')
 
 
(2 intermediate revisions by the same user not shown)
Line 11: Line 11:
==Related facts==
==Related facts==


===Easy case===
===Stronger facts===
 
* [[Chebotarev density theorem]]
 
===Easy cases===


* [[There are infinitely many primes that are one modulo any modulus]]
* [[There are infinitely many primes that are one modulo any modulus]]
* [[Dirichlet's theorem for modulus four]]
* [[Dirichlet's theorem for modulus eight]]


===Related facts about infinitude===
* [[Infinitude of primes]]
* [[Set of primes is large]]
===Conjectures/facts about the first Dirichlet prime===
===Conjectures/facts about the first Dirichlet prime===


Line 20: Line 30:
* [[Chowla's conjecture on the first Dirichlet prime]]: A conjecture, saying that the first Dirichlet prime in a given congruence class modulo <math>D</math> is <math>O(D^{1 + \epsilon})</math>.
* [[Chowla's conjecture on the first Dirichlet prime]]: A conjecture, saying that the first Dirichlet prime in a given congruence class modulo <math>D</math> is <math>O(D^{1 + \epsilon})</math>.
* [[Chowla's corollary to generalized Riemannn hypothesis]]: Proved conditional to the [[generalized Riemann hypothesis]], saying that the first Dirichlet prime in a given congruence class modulo <math>D</math> is <math>O(D^{2 + \epsilon})</math>.
* [[Chowla's corollary to generalized Riemannn hypothesis]]: Proved conditional to the [[generalized Riemann hypothesis]], saying that the first Dirichlet prime in a given congruence class modulo <math>D</math> is <math>O(D^{2 + \epsilon})</math>.
* [[Linnick's theorem]]: An unconditional theorem, saying that there exists <math>L > 0</math> such that the first Dirichlet prime in a given congruence class modulo <math>D</math> is <math>O(D^L)</math>. Heath-Brown showed that we can take <math>L = 5.5</math>.
* [[Linnik's theorem]]: An unconditional theorem, saying that there exists <math>L > 0</math> such that the first Dirichlet prime in a given congruence class modulo <math>D</math> is <math>O(D^L)</math>. Heath-Brown showed that we can take <math>L = 5.5</math>.


===Conjectures/facts about Bertrand's postulate on Dirichlet primes===
===Conjectures/facts about Bertrand's postulate on Dirichlet primes===
Line 27: Line 37:


* [[Green-Tao theorem]]: This states that for any <math>k</math>, there exists a [[prime arithmetic progression]] of length <math>k</math>: an arithmetic progression of length <math>k</math>, all of whose members are primes.
* [[Green-Tao theorem]]: This states that for any <math>k</math>, there exists a [[prime arithmetic progression]] of length <math>k</math>: an arithmetic progression of length <math>k</math>, all of whose members are primes.
===Conjectures that generalize to higher degree polynomials===
* [[Bunyakovsky conjecture]] is a conjecture for polynomials of degree two or more whose analogue for linear polynomials would be Dirichlet's theorem.

Latest revision as of 00:45, 3 July 2012

Template:Infinitude fact

Statement

Let be relatively prime natural numbers. Then, there exist infinitely many primes such that:

.

For fixed , the primes that are congruent to modulo are termed Dirichlet primes.

Related facts

Stronger facts

Easy cases

Related facts about infinitude

Conjectures/facts about the first Dirichlet prime

Conjectures/facts about Bertrand's postulate on Dirichlet primes

Conjectures/facts about contiguous blocks of Dirichlet primes

  • Green-Tao theorem: This states that for any , there exists a prime arithmetic progression of length : an arithmetic progression of length , all of whose members are primes.

Conjectures that generalize to higher degree polynomials

  • Bunyakovsky conjecture is a conjecture for polynomials of degree two or more whose analogue for linear polynomials would be Dirichlet's theorem.