Dirichlet's theorem on arithmetic progressions

<h2 id="examples">Examples</h2>
The primes of the form 4n + 3 are (sequence A002145 in the <a href="/facts/On-Line_Encyclopedia_of_Integer_Sequences/yow6cVsU">OEIS</a>)

3, 7, 11, 19, 23, 31, 43, 47, 59, 67, 71, 79, 83, 103, 107, 127, 131, 139, 151, 163, 167, 179, 191, 199, 211, 223, 227, 239, 251, 263, 271, 283, ...
They correspond to the following values of n: (sequence A095278 in the <a href="/facts/On-Line_Encyclopedia_of_Integer_Sequences/yow6cVsU">OEIS</a>)

0, 1, 2, 4, 5, 7, 10, 11, 14, 16, 17, 19, 20, 25, 26, 31, 32, 34, 37, 40, 41, 44, 47, 49, 52, 55, 56, 59, 62, 65, 67, 70, 76, 77, 82, 86, 89, 91, 94, 95, ...
The strong form of Dirichlet's theorem implies that

1
            3
          
        
        +
        
          
            1
            7
          
        
        +
        
          
            1
            11
          
        
        +
        
          
            1
            19
          
        
        +
        
          
            1
            23
          
        
        +
        
          
            1
            31
          
        
        +
        
          
            1
            43
          
        
        +
        
          
            1
            47
          
        
        +
        
          
            1
            59
          
        
        +
        
          
            1
            67
          
        
        +
        ⋯
      
    
    {\displaystyle {\frac {1}{3}}+{\frac {1}{7}}+{\frac {1}{11}}+{\frac {1}{19}}+{\frac {1}{23}}+{\frac {1}{31}}+{\frac {1}{43}}+{\frac {1}{47}}+{\frac {1}{59}}+{\frac {1}{67}}+\cdots }

is a <a href="/facts/Divergent_series/c8Vjjjdx">divergent series</a>.
Sequences dn + a with odd d are often ignored because half the numbers are even and the other half is the same numbers as a sequence with 2d, if we start with n = 0. For example, 6n + 1 produces the same primes as 3n + 1, while 6n + 5 produces the same as 3n + 2 except for the only even prime 2. The following table lists several arithmetic progressions with infinitely many primes and the first few ones in each of them.

<table><tbody><tr><th>Arithmeticprogression</th><th>First 10 of infinitely many primes</th><th><a href="/facts/On-Line_Encyclopedia_of_Integer_Sequences/yow6cVsU">OEIS</a> sequence</th></tr><tr><td>2n + 1</td><td>3, 5, 7, 11, 13, 17, 19, 23, 29, 31, …</td><td>A065091</td></tr><tr><td>4n + 1</td><td>5, 13, 17, 29, 37, 41, 53, 61, 73, 89, …</td><td>A002144</td></tr><tr><td>4n + 3</td><td>3, 7, 11, 19, 23, 31, 43, 47, 59, 67, …</td><td>A002145</td></tr><tr><td>6n + 1</td><td>7, 13, 19, 31, 37, 43, 61, 67, 73, 79, …</td><td>A002476</td></tr><tr><td>6n + 5</td><td>5, 11, 17, 23, 29, 41, 47, 53, 59, 71, …</td><td>A007528</td></tr><tr><td>8n + 1</td><td>17, 41, 73, 89, 97, 113, 137, 193, 233, 241, …</td><td>A007519</td></tr><tr><td>8n + 3</td><td>3, 11, 19, 43, 59, 67, 83, 107, 131, 139, …</td><td>A007520</td></tr><tr><td>8n + 5</td><td>5, 13, 29, 37, 53, 61, 101, 109, 149, 157, …</td><td>A007521</td></tr><tr><td>8n + 7</td><td>7, 23, 31, 47, 71, 79, 103, 127, 151, 167, …</td><td>A007522</td></tr><tr><td>10n + 1</td><td>11, 31, 41, 61, 71, 101, 131, 151, 181, 191, …</td><td>A030430</td></tr><tr><td>10n + 3</td><td>3, 13, 23, 43, 53, 73, 83, 103, 113, 163, …</td><td>A030431</td></tr><tr><td>10n + 7</td><td>7, 17, 37, 47, 67, 97, 107, 127, 137, 157, …</td><td>A030432</td></tr><tr><td>10n + 9</td><td>19, 29, 59, 79, 89, 109, 139, 149, 179, 199, …</td><td>A030433</td></tr><tr><td>12n + 1</td><td>13, 37, 61, 73, 97, 109, 157, 181, 193, 229, ...</td><td>A068228</td></tr><tr><td>12n + 5</td><td>5, 17, 29, 41, 53, 89, 101, 113, 137, 149, ...</td><td>A040117</td></tr><tr><td>12n + 7</td><td>7, 19, 31, 43, 67, 79, 103, 127, 139, 151, ...</td><td>A068229</td></tr><tr><td>12n + 11</td><td>11, 23, 47, 59, 71, 83, 107, 131, 167, 179, ...</td><td>A068231</td></tr></tbody></table>
We can generate some forms of primes by using an iterative method. For example, we can generate primes of the form 
 
 
 
 4
 n
 +
 3
 
 
 {\displaystyle 4n+3}
 
 by using the following method:
Let 
 
 
 
 
 a
 
 0
 
 
 =
 4
 (
 1
 )
 +
 3
 =
 7
 
 
 {\displaystyle a_{0}=4(1)+3=7}
 
. Then we let 
 
 
 
 
 a
 
 1
 
 
 =
 4
 
 a
 
 0
 
 
 +
 3
 =
 4
 (
 7
 )
 +
 3
 =
 31
 
 
 {\displaystyle a_{1}=4a_{0}+3=4(7)+3=31}
 
 which is prime. We continue by computing 
 
 
 
 4
 (
 7
 )
 (
 31
 )
 +
 3
 =
 871
 =
 13
 (
 67
 )
 
 
 {\displaystyle 4(7)(31)+3=871=13(67)}
 
. Because 
 
 
 
 4
 (
 7
 )
 (
 31
 )
 +
 3
 
 
 {\displaystyle 4(7)(31)+3}
 
 is of the form 
 
 
 
 4
 n
 +
 3
 
 
 {\displaystyle 4n+3}
 
, either 13 or 67 is of the form 
 
 
 
 4
 n
 +
 3
 
 
 {\displaystyle 4n+3}
 
. We have that 
 
 
 
 67
 =
 4
 (
 16
 )
 +
 3
 
 
 {\displaystyle 67=4(16)+3}
 
 and is prime, so 
 
 
 
 
 a
 
 3
 
 
 =
 67
 
 
 {\displaystyle a_{3}=67}
 
. We then continue this process to find successive primes of the form 
 
 
 
 4
 n
 +
 3
 
 
 {\displaystyle 4n+3}
 
 (Silverman 2013). 

<h2 id="distribution">Distribution</h2>
See also: <a href="/facts/Prime_number_theorem/3KA9egls">Prime number theorem § Prime number theorem for arithmetic progressions</a>
Since the primes thin out, on average, in accordance with the <a href="/facts/Prime_number_theorem/3KA9egls">prime number theorem</a>, the same must be true for the primes in arithmetic progressions. It is natural to ask about the way the primes are shared between the various arithmetic progressions for a given value of d (there are d of those, essentially, if we do not distinguish two progressions sharing <a href="/facts/Almost_all/KvHxUCCc">almost all</a> their terms). The answer is given in this form: the number of feasible progressions modulo d — those where a and d do not have a common factor > 1 — is given by <a href="/facts/Euler%27s_totient_function/mIQwXYzj">Euler's totient function</a>

φ
        (
        d
        )
        .
         
      
    
    {\displaystyle \varphi (d).\ }

Further, the proportion of primes in each of those is

1
            
              φ
              (
              d
              )
            
          
        
        .
         
      
    
    {\displaystyle {\frac {1}{\varphi (d)}}.\ }

For example, if d is a prime number q, each of the q − 1 progressions

q
        +
        1
        ,
        2
        q
        +
        1
        ,
        3
        q
        +
        1
        ,
        …
         
      
    
    {\displaystyle q+1,2q+1,3q+1,\dots \ }

q
        +
        2
        ,
        2
        q
        +
        2
        ,
        3
        q
        +
        2
        ,
        …
         
      
    
    {\displaystyle q+2,2q+2,3q+2,\dots \ }

…
         
      
    
    {\displaystyle \dots \ }

q
        +
        q
        −
        1
        ,
        2
        q
        +
        q
        −
        1
        ,
        3
        q
        +
        q
        −
        1
        ,
        …
         
      
    
    {\displaystyle q+q-1,2q+q-1,3q+q-1,\dots \ }

(all except 
 
 
 
 q
 ,
 2
 q
 ,
 3
 q
 ,
 …
  
 
 
 {\displaystyle q,2q,3q,\dots \ }
 
)
contains a proportion 1/(q − 1) of the primes.
When compared to each other, progressions with a quadratic nonresidue remainder have typically slightly more elements than those with a quadratic residue remainder (<a href="/facts/Chebyshev%27s_bias/sW8aw7zB">Chebyshev's bias</a>).

<h2 id="history">History</h2>
In 1737, Euler related the study of prime numbers to what is known now as the Riemann zeta function: he showed that the value 
 
 
 
 ζ
 (
 1
 )
 
 
 {\displaystyle \zeta (1)}
 
 reduces to a ratio of two infinite products, Π p / Π (p–1), for all primes p, and that the ratio is infinite.<a class="footnote-ref" id="fnref:1" href="#fn:1">1</a><a class="footnote-ref" id="fnref:2" href="#fn:2">2</a> In 1775, Euler stated the theorem for the cases of a + nd, where a = 1.<a class="footnote-ref" id="fnref:3" href="#fn:3">3</a> 
This special case of Dirichlet's theorem can be proven using <a href="/facts/Cyclotomic_polynomial/TsWXDHIp">cyclotomic polynomials</a>.<a class="footnote-ref" id="fnref:4" href="#fn:4">4</a>
The general form of the theorem was first conjectured by <a href="/facts/Adrien-Marie_Legendre/2a7CAolM">Legendre</a> in his attempted unsuccessful proofs of <a href="/facts/Quadratic_reciprocity/leCHbu5B">quadratic reciprocity</a><a class="footnote-ref" id="fnref:5" href="#fn:5">5</a> — as <a href="/facts/Carl_Friedrich_Gauss/f4eSMBD7">Gauss</a> noted in his <a href="/facts/Disquisitiones_Arithmeticae/VQ38ReTh">Disquisitiones Arithmeticae</a><a class="footnote-ref" id="fnref:6" href="#fn:6">6</a> — but it was proved by <a href="/facts/Peter_Gustav_Lejeune_Dirichlet/b5UIU7Uy">Dirichlet</a> (1837) with <a href="/facts/Dirichlet_L-series/my8hc6Qy">Dirichlet L-series</a>. The proof is modeled on Euler's earlier work relating the <a href="/facts/Riemann_zeta_function/MnfRu7lY">Riemann zeta function</a> to the distribution of primes. The theorem represents the beginning of rigorous <a href="/facts/Analytic_number_theory/mrHbWwrx">analytic number theory</a>.
<a href="/facts/Atle_Selberg/3JDSUN2k">Atle Selberg</a> (1949) gave an <a href="/facts/Elementary_proof/zv8dBPXx">elementary proof</a>.

<h2 id="proof">Proof</h2>
Dirichlet's theorem is proved by showing that the value of the <a href="/facts/Dirichlet_L-function/my8hc6Qy">Dirichlet L-function</a> (of a non-trivial <a href="/facts/Dirichlet_character/jDJHEBWa">character</a>) at 1 is nonzero. The proof of this statement requires some calculus and <a href="/facts/Analytic_number_theory/mrHbWwrx">analytic number theory</a> (Serre 1973). The particular case a = 1 (i.e., concerning the primes that are congruent to 1 modulo some n) can be proven by analyzing the splitting behavior of primes in cyclotomic extensions, without making use of calculus (Neukirch 1999, §VII.6).
Although the proof of Dirichlet's Theorem makes use of calculus and analytic number theory, some proofs of examples are much more straightforward. In particular, the proof of the example of infinitely many primes of the form 
 
 
 
 4
 n
 +
 3
 
 
 {\displaystyle 4n+3}
 
 makes an argument similar to the one made in the proof of <a href="/facts/Euclid%27s_theorem/Nl4SM0P0">Euclid's theorem</a> (Silverman 2013). The proof is given below:
We want to prove that there are infinitely many primes of the form 
 
 
 
 4
 n
 +
 3
 
 
 {\displaystyle 4n+3}
 
. Assume, for contradiction, that there are only finitely many primes of the form 
 
 
 
 4
 n
 +
 3
 
 
 {\displaystyle 4n+3}
 
. We then compile a list of all such primes 
 
 
 
 3
 ,
 
 p
 
 1
 
 
 ,
 
 p
 
 2
 
 
 ,
 .
 .
 .
 ,
 
 p
 
 m
 
 
 
 
 {\displaystyle 3,p_{1},p_{2},...,p_{m}}
 
 where 
 
 
 
 
 p
 
 1
 
 
 <
 
 p
 
 2
 
 
 <
 .
 .
 .
 <
 
 p
 
 m
 
 
 
 
 {\displaystyle p_{1}<p_{2}<...<p_{m}}
 
. Let 
 
 
 
 N
 =
 4
 
 p
 
 1
 
 
 
 p
 
 2
 
 
 .
 .
 .
 
 p
 
 m
 
 
 +
 3
 
 
 {\displaystyle N=4p_{1}p_{2}...p_{m}+3}
 
. It is clear that none of the primes in the list 
 
 
 
 3
 ,
 
 p
 
 1
 
 
 ,
 
 p
 
 2
 
 
 ,
 .
 .
 .
 ,
 
 p
 
 m
 
 
 
 
 {\displaystyle 3,p_{1},p_{2},...,p_{m}}
 
 divide 
 
 
 
 N
 
 
 {\displaystyle N}
 
. Next, suppose that 
 
 
 
 N
 
 
 {\displaystyle N}
 
 is composite. Then 
 
 
 
 N
 
 
 {\displaystyle N}
 
 has unique prime factorization 
 
 
 
 N
 =
 
 a
 
 1
 
 
 
 a
 
 2
 
 
 .
 .
 .
 
 a
 
 r
 
 
 
 
 {\displaystyle N=a_{1}a_{2}...a_{r}}
 
 where each 
 
 
 
 
 a
 
 i
 
 
 
 
 {\displaystyle a_{i}}
 
 is prime. Because 
 
 
 
 N
 ≡
 3
 
 mod
 
 4
 
 
 
 
 {\displaystyle N\equiv 3{\bmod {4}}}
 
, 
 
 
 
 N
 
 
 {\displaystyle N}
 
 is odd and must be the product of only odd primes. Any odd prime 
 
 
 
 p
 
 
 {\displaystyle p}
 
 must be such that 
 
 
 
 p
 ≡
 1
 
 mod
 
 4
 
 
 
 
 {\displaystyle p\equiv 1{\bmod {4}}}
 
 or 
 
 
 
 p
 ≡
 3
 
 mod
 
 4
 
 
 
 
 {\displaystyle p\equiv 3{\bmod {4}}}
 
. It cannot be that 
 
 
 
 
 a
 
 i
 
 
 ≡
 1
 
 mod
 
 4
 
 
 
 
 {\displaystyle a_{i}\equiv 1{\bmod {4}}}
 
 
 
 
 
 ∀
 
 a
 
 i
 
 
 
 
 {\displaystyle \forall a_{i}}
 
 because if this were the case, then 
 
 
 
 N
 ≡
 1
 
 mod
 
 4
 
 
 
 
 {\displaystyle N\equiv 1{\bmod {4}}}
 
. So there exists a prime 
 
 
 
 
 a
 
 i
 
 
 ≡
 3
 
 mod
 
 4
 
 
 
 
 {\displaystyle a_{i}\equiv 3{\bmod {4}}}
 
 such that 
 
 
 
 
 a
 
 i
 
 
 ∣
 N
 
 
 {\displaystyle a_{i}\mid N}
 
. However, none of the primes in the list 
 
 
 
 3
 ,
 
 p
 
 1
 
 
 ,
 
 p
 
 2
 
 
 ,
 .
 .
 .
 ,
 
 p
 
 m
 
 
 
 
 {\displaystyle 3,p_{1},p_{2},...,p_{m}}
 
 divide 
 
 
 
 N
 
 
 {\displaystyle N}
 
, a contradiction. Therefore 
 
 
 
 N
 
 
 {\displaystyle N}
 
 must be prime and 
 
 
 
 N
 >
 
 p
 
 m
 
 
 
 
 {\displaystyle N>p_{m}}
 
. Hence, 
 
 
 
 N
 
 
 {\displaystyle N}
 
 is a prime of the form 
 
 
 
 4
 n
 +
 3
 
 
 {\displaystyle 4n+3}
 
, but it isn't included in the list 
 
 
 
 3
 ,
 
 p
 
 1
 
 
 ,
 
 p
 
 2
 
 
 ,
 .
 .
 .
 ,
 
 p
 
 m
 
 
 
 
 {\displaystyle 3,p_{1},p_{2},...,p_{m}}
 
. Thus, the list doesn't contain all such primes and there must be infinitely many primes of the form 
 
 
 
 4
 n
 +
 3
 
 
 {\displaystyle 4n+3}
 
 (Silverman 2013).

<h2 id="generalizations">Generalizations</h2>
The <a href="/facts/Bunyakovsky_conjecture/xsnfHIj7">Bunyakovsky conjecture</a> generalizes Dirichlet's theorem to higher-degree polynomials. Whether or not even simple quadratic polynomials such as x2 + 1 (known from <a href="/facts/Landau%27s_problems/vqLTtmeR">Landau's fourth problem</a>) attain infinitely many prime values is an important <a href="/facts/Open_problem/VuR6yLsW">open problem</a>.
<a href="/facts/Dickson%27s_conjecture/PEftYcoe">Dickson's conjecture</a> generalizes Dirichlet's theorem to more than one polynomial.
<a href="/facts/Schinzel%27s_hypothesis_H/6Sckht9T">Schinzel's hypothesis H</a> generalizes these two conjectures, i.e. generalizes to more than one polynomial with degree larger than one.
In <a href="/facts/Algebraic_number_theory/LPzDT5CA">algebraic number theory</a>, Dirichlet's theorem generalizes to the <a href="/facts/Chebotarev%27s_density_theorem/Ekg3wmbs">Chebotarev's density theorem</a>.
<a href="/facts/Linnik%27s_theorem/uHBtyx00">Linnik's theorem</a> (1944) concerns the size of the smallest prime in a given arithmetic progression. Linnik proved that the progression a + nd (as n ranges through the positive integers) contains a prime of magnitude at most cdL for absolute constants c and L. Subsequent researchers have reduced L to 5.
An analogue of Dirichlet's theorem holds in the framework of dynamical systems (<a href="/facts/Toshikazu_Sunada/8lkWp16o">T. Sunada</a> and A. Katsuda, 1990).
Shiu showed that any arithmetic progression satisfying the hypothesis of Dirichlet's theorem will in fact contain arbitrarily long runs of consecutive prime numbers.<a class="footnote-ref" id="fnref:7" href="#fn:7">7</a>

<h2 id="see-also">See also</h2>
<ul><li><a href="/facts/Bombieri%E2%80%93Vinogradov_theorem/x83MjQoK">Bombieri–Vinogradov theorem</a></li>
<li><a href="/facts/Brun%E2%80%93Titchmarsh_theorem/8FxqzVwW">Brun–Titchmarsh theorem</a></li>
<li><a href="/facts/Siegel%E2%80%93Walfisz_theorem/nJ6SNyko">Siegel–Walfisz theorem</a></li>
<li><a href="/facts/Dirichlet%27s_approximation_theorem/MA2HlQN6">Dirichlet's approximation theorem</a></li>
<li><a href="/facts/Green%E2%80%93Tao_theorem/kGTx52Vp">Green–Tao theorem</a></li></ul>
<h2 id="notes">Notes</h2>

<ul><li><a href="/facts/Tom_M._Apostol/S6vGtJWN">Apostol, Tom M.</a> (1976), Introduction to analytic number theory, Undergraduate Texts in Mathematics, New York-Heidelberg: Springer-Verlag, <a href="/facts/ISBN_(identifier)/15AdSPa9">ISBN</a> 978-0-387-90163-3, <a href="/facts/MR_(identifier)/uP137L11">MR</a> <a href="https://mathscinet.ams.org/mathscinet-getitem?mr=0434929">0434929</a>, <a href="/facts/Zbl_(identifier)/P6rFxKKx">Zbl</a> <a href="https://zbmath.org/?format=complete&q=an:0335.10001">0335.10001</a></li>
<li><a href="/facts/Eric_W._Weisstein/FbMuVDep">Weisstein, Eric W.</a> <a href="https://mathworld.wolfram.com/DirichletsTheorem.html">"Dirichlet's Theorem"</a>. <a href="/facts/MathWorld/yc1jodbq">MathWorld</a>.</li>
<li>Chris Caldwell, <a href="http://primes.utm.edu/notes/Dirichlet.html">"Dirichlet's Theorem on Primes in Arithmetic Progressions"</a> at the <a href="/facts/Prime_Pages/d1pM4IgB">Prime Pages</a>.</li>
<li><a href="/facts/Peter_Gustav_Lejeune_Dirichlet/b5UIU7Uy">Dirichlet, P. G. L.</a> (1837), <a href="https://babel.hathitrust.org/cgi/pt?id=chi.56785536;view=1up;seq=305">"Beweis des Satzes, dass jede unbegrenzte arithmetische Progression, deren erstes Glied und Differenz ganze Zahlen ohne gemeinschaftlichen Factor sind, unendlich viele Primzahlen enthält"</a> [Proof of the theorem that every unbounded arithmetic progression, whose first term and common difference are integers without common factors, contains infinitely many prime numbers], Abhandlungen der Königlichen Preußischen Akademie der Wissenschaften zu Berlin, 48: 45–71</li>
<li><a href="/facts/J%C3%BCrgen_Neukirch/nzVc4G3F">Neukirch, Jürgen</a> (1999), Algebraic number theory. Translated from the 1992 German original and with a note by Norbert Schappacher, Grundlehren der Mathematischen Wissenschaften [Fundamental Principles of Mathematical Sciences], vol. 322, Berlin: <a href="/facts/Springer-Verlag/nAesf6nT">Springer-Verlag</a>, <a href="/facts/ISBN_(identifier)/15AdSPa9">ISBN</a> 3-540-65399-6, <a href="/facts/MR_(identifier)/uP137L11">MR</a> <a href="https://mathscinet.ams.org/mathscinet-getitem?mr=1697859">1697859</a>, <a href="/facts/Zbl_(identifier)/P6rFxKKx">Zbl</a> <a href="https://zbmath.org/?format=complete&q=an:0956.11021">0956.11021</a>.</li>
<li><a href="/facts/Atle_Selberg/3JDSUN2k">Selberg, Atle</a> (1949), "An elementary proof of Dirichlet's theorem about primes in an arithmetic progression", <a href="/facts/Annals_of_Mathematics/CUYktUqD">Annals of Mathematics</a>, 50 (2): 297–304, <a href="/facts/Doi_(identifier)/muM9Etpq">doi</a>:<a href="https://doi.org/10.2307%2F1969454">10.2307/1969454</a>, <a href="/facts/JSTOR_(identifier)/YTeVmaJ7">JSTOR</a> <a href="https://www.jstor.org/stable/1969454">1969454</a>, <a href="/facts/Zbl_(identifier)/P6rFxKKx">Zbl</a> <a href="https://zbmath.org/?format=complete&q=an:0036.30603">0036.30603</a>.</li>
<li>Serre, Jean-Pierre (1973), A course in arithmetic, <a href="/facts/Graduate_Texts_in_Mathematics/VTIfY29j">Graduate Texts in Mathematics</a>, vol. 7, New York; Heidelberg; Berlin: <a href="/facts/Springer-Verlag/nAesf6nT">Springer-Verlag</a>, <a href="/facts/ISBN_(identifier)/15AdSPa9">ISBN</a> 3-540-90040-3, <a href="/facts/Zbl_(identifier)/P6rFxKKx">Zbl</a> <a href="https://zbmath.org/?format=complete&q=an:0256.12001">0256.12001</a>.</li>
<li><a href="/facts/Toshikazu_Sunada/8lkWp16o">Sunada, Toshikazu</a>; Katsuda, Atsushi (1990), <a href="http://www.numdam.org/item/PMIHES_1990__71__5_0/">"Closed orbits in homology classes"</a>, Publ. Math. IHÉS, 71: 5–32, <a href="/facts/Doi_(identifier)/muM9Etpq">doi</a>:<a href="https://doi.org/10.1007%2FBF02699875">10.1007/BF02699875</a>, <a href="/facts/S2CID_(identifier)/ldJsHa2Y">S2CID</a> <a href="https://api.semanticscholar.org/CorpusID:26251216">26251216</a>.</li>
<li><a href="https://www.pearson.com/en-us/pearsonplus/p/9780137981175">Silverman JH (2013) A Friendly Introduction to Number Theory: Pearson New International Edition, Pearson Education.</a></li></ul>
<h2 id="external-links">External links</h2>
<ul><li><a href="https://bibliothek.bbaw.de/digitalisierte-sammlungen/akademieschriften/ansicht-akademieschriften?tx_bbaw_academicpublicationshow%5baction%5d=show&tx_bbaw_academicpublicationshow%5bcontroller%5d=AcademicPublication\Volume&tx_bbaw_academicpublicationshow%5bpage%5d=286&tx_bbaw_academicpublicationshow%5bvolume%5d=108&cHash=cdcc91473488a5ab2956096880af8f0f">Scans of the original paper in German</a></li>
<li><a href="https://arxiv.org/abs/0808.1408">Dirichlet: There are infinitely many prime numbers in all arithmetic progressions with first term and difference coprime</a> English translation of the original paper at the arXiv</li>
<li><a href="http://demonstrations.wolfram.com/DirichletsTheorem/">Dirichlet's Theorem</a> by Jay Warendorff, <a href="/facts/Wolfram_Demonstrations_Project/l0sh4gln">Wolfram Demonstrations Project</a>.</li></ul>

<h2 id="references">References</h2>

<ol>
<li id="fn:1">Euler, Leonhard (1737). "Variae observationes circa series infinitas" [Various observations about infinite series]. Commentarii Academiae Scientiarum Imperialis Petropolitanae. 9: 160–188.; specifically, Theorema 7 on pp. 172–174. <a href="https://books.google.com/books?id=cVo-AAAAcAAJ&pg=PA160" target="_blank">https://books.google.com/books?id=cVo-AAAAcAAJ&pg=PA160</a> <a href="#fnref:1" class="footnote-back-ref">↩</a></li>
<li id="fn:2">Sandifer, C. Edward, The Early Mathematics of Leonhard Euler (Washington, D.C.: The Mathematical Association of America, 2007), p. 253. <a href="https://books.google.com/books?id=CvBxLr_0uBQC&pg=PA253" target="_blank">https://books.google.com/books?id=CvBxLr_0uBQC&pg=PA253</a> <a href="#fnref:2" class="footnote-back-ref">↩</a></li>
<li id="fn:3">Leonhard Euler, "De summa seriei ex numeris primis formatae 1/3 − 1/5 + 1/7 + 1/11 − 1/13 − 1/17 + 1/19 + 1/23 − 1/29 + 1/31 etc. ubi numeri primi formae 4n − 1 habent signum positivum, formae autem 4n + 1 signum negativum" (On the sum of series [composed] of prime numbers arranged 1/3 − 1/5 + 1/7 + 1/11 − 1/13 − 1/17 + 1/19 + 1/23 − 1/29 + 1/31 etc., where the prime numbers of the form 4n − 1 have a positive sign, whereas [those] of the form 4n + 1 [have] a negative sign.) in: Leonhard Euler, Opuscula analytica (St. Petersburg, Russia: Imperial Academy of Sciences, 1785), vol. 2, pp. 240–256; see p. 241. From p. 241: "Quoniam porro numeri primi praeter binarium quasi a natura in duas classes distinguuntur, prouti fuerint vel formae 4n + 1, vel formae 4n − 1, dum priores omnes sunt summae duorum quadratorum, posteriores vero ab hac proprietate penitus excluduntur: series reciprocae ex utraque classes formatae, scillicet:
1/5 + 1/13 + 1/17 + 1/29 + etc. et
1/3 + 1/7 + 1/11 + 1/19 + 1/23 + etc.
ambae erunt pariter infinitae, id quod etiam de omnibus speciebus numerorum primorum est tenendum. Ita si ex numeris primis ii tantum excerpantur, qui sunt formae 100n + 1, cuiusmodi sunt 101, 401, 601, 701, etc., non solum multitudo eorum est infinita, sed etiam summa huius seriei ex illis formatae, scillicet:
1/101 + 1/401 + 1/601 + 1/701 + 1/1201 + 1/1301 + 1/1601 + 1/1801 + 1/1901 + etc.
etiam est infinita." (Since, further, prime numbers larger than two are divided as if by Nature into two classes, according as they were either of the form 4n + 1, or of the form 4n − 1, as all of the first are sums of two squares, but the latter are thoroughly excluded from this property: reciprocal series formed from both classes, namely:
1/5 + 1/13 + 1/17 + 1/29 + etc. and
1/3 + 1/7 + 1/11 + 1/19 + 1/23 + etc.
will both be equally infinite, which [property] likewise is to be had from all types of prime numbers. Thus, if there be chosen from the prime numbers only those that are of the form 100n + 1, of which kind are 101, 401, 601, 701, etc., not only the set of these is infinite, but likewise the sum of the series formed from that [set], namely:
1/101 + 1/401 + 1/601 + 1/701 + 1/1201 + 1/1301 + 1/1601 + 1/1801 + 1/1901 + etc.
likewise is infinite.) <a href="https://books.google.com/books?id=spQ_AAAAcAAJ&pg=PA241" target="_blank">https://books.google.com/books?id=spQ_AAAAcAAJ&pg=PA241</a> <a href="#fnref:3" class="footnote-back-ref">↩</a></li>
<li id="fn:4">Neukirch (1999), §I.10, Exercise 1. - Neukirch, Jürgen (1999), Algebraic number theory. Translated from the 1992 German original and with a note by Norbert Schappacher, Grundlehren der Mathematischen Wissenschaften [Fundamental Principles of Mathematical Sciences], vol. 322, Berlin: Springer-Verlag, ISBN 3-540-65399-6, MR 1697859, Zbl 0956.11021 <a href="https://mathscinet.ams.org/mathscinet-getitem?mr=1697859" target="_blank">https://mathscinet.ams.org/mathscinet-getitem?mr=1697859</a> <a href="#fnref:4" class="footnote-back-ref">↩</a></li>
<li id="fn:5">See:
Le Gendre (1785) "Recherches d'analyse indéterminée" (Investigations of interdeterminate analysis), Histoire de l'Académie royale des sciences, avec les mémoires de mathématique et de physique, pp. 465–559; see especially p. 552. From p. 552: "34. Remarque. Il seroit peut-être nécessaire de démontrer rigoureusement une chose que nous avons supposée dans plusieurs endroits de cet article, savoir, qu'il y a une infinité de nombres premiers compris dans tous progression arithmétique, dont le premier terme & la raison sont premiers entr'eux, ou, ce qui revient au même, dans la formule 2mx + μ, lorsque 2m & μ n'ont point de commun diviseur. Cette proposition est assez difficile à démontrer, cependant on peut s'assurer qu'elle est vraie, en comparant la progression arithmétique dont il s'agit, à la progression ordinaire 1, 3, 5, 7, &c. Si on prend un grand nombre de termes de ces progressions, le même dans les deux, & qu'on les dispose, par exemple, de manière que le plus grand terme soit égal & à la même place de part & d'autre; on verra qu'en omettant de chaque côté les multiples de 3, 5, 7, &c. jusqu'à un certain nombre premier p, il doit rester des deux côtés le même nombre de termes, ou même il en restera moins dans la progression 1, 3, 5, 7, &c. Mais comme dans celle-ci, il reste nécessairement des nombres premiers, il en doit rester aussi dans l'autre." (34. Remark. It will perhaps be necessary to prove rigorously something that we have assumed at several places in this article, namely, that there is an infinitude of prime numbers included in every arithmetic progression, whose first term and common difference are co-prime, or, what amounts to the same thing, in the formula 2mx + μ, when 2m and μ have no common divisors at all. This proposition is rather difficult to prove, however one may be assured that it is true, by comparing the arithmetic progression being considered to the ordinary progression 1, 3, 5, 7, etc. If one takes a great number of terms of these progressions, the same [number of terms] in both, and if one arranges them, for example, in a way that the largest term be equal and at the same place in both; one will see that by omitting from each the multiples of 3, 5, 7, etc., up to a certain prime number p, there should remain in both the same number of terms, or even there will remain fewer of them in the progression 1, 3, 5, 7, etc. But as in this [set], there necessarily remain prime numbers, there shall also remain some in the other [set].)
A. M. Legendre, Essai sur la Théorie des Nombres (Paris, France: Duprat, 1798), Introduction, pp. 9–16. From p. 12: "XIX. … En général, a étant un nombre donné quelconque, tout nombres impair peut être représenté par la formule 4ax ± b, dans laquelle b est impair et moindre que 2a. Si parmi tous les valeurs possibles de b on retranche celles qui ont un commun diviseur avec a, les formes restantes 4ax ± b comprendront tous les nombres premiers partagé, … " (XIX. … In general, a being any given number, all odd numbers can be represented by the formula 4ax ± b, in which b is odd and less than 2a. If among all possible values of b one removes those that have a common divisor with a, the remaining formulas 4ax ± b include all prime numbers among them … )
A. M. Legendre, Essai sur la Théorie des Nombres, 2nd ed. (Paris, France: Courcier, 1808), p. 404. From p. 404: "Soit donnée une progression arithmétique quelconque A − C, 2A − C, 3A − C, etc., dans laquelle A et C sont premiers entre eux; soit donnée aussi une suite θ, λ, μ … ψ, ω, composée de k nombres premiers impairs, pris à volonté et disposés dans un order quelconque; si on appelle en général π(z) le zième terme de la suite naturelle des nombres premiers 3, 5, 7, 11, etc., je dis que sur π(k-1) termes consécutifs de la progression proposée, il y en aura au moins un qui ne sera divisible par aucun des nombres premiers θ, λ, μ … ψ, ω." (Let there be given any arithmetic progression A − C, 2A − C, 3A − C, etc., in which A and C are prime among themselves [i.e., coprime]; let there be given also a series θ, λ, μ … ψ, ω composed of k odd prime numbers, taken at will and arranged in any order; if one calls in general π(z) the zth term of the natural series of prime numbers 3, 5, 7, 11, etc., I claim that among the π(k−1) consecutive terms of the proposed progression, there will be at least one of them that will not be divisible by any of the prime numbers θ, λ, μ … ψ, ω.) This assertion was proven false in 1858 by Anthanase Louis Dupré (1808–1869). See:
Dupré, A. (1859) Examen d'une proposition de Legendre relative à la théorie des nombres [Examination of a proposition of Legendre regarding the theory of numbers] (Paris, France: Mallet-Bachelier, 1859).
Narkiewicz, Władysław, The Development of Prime Number Theory: From Euclid to Hardy and Littlewood (Berlin, Germany: Springer, 2000); see especially p. 50.
 <a href="https://archive.org/stream/histoiredelacad85hist#page/464/mode/2up" target="_blank">https://archive.org/stream/histoiredelacad85hist#page/464/mode/2up</a> <a href="#fnref:5" class="footnote-back-ref">↩</a></li>
<li id="fn:6">Carl Friedrich Gauss, Disquisitiones arithmeticae (Leipzig, (Germany): Gerhard Fleischer, Jr., 1801), Section 297, pp. 507–508. From pp. 507–508: "Ill. Le Gendre ipse fatetur, demonstrationem theorematis, sub tali forma kt + l, designantibus k, l numeros inter se primos datos, t indefinitum, certo contineri numeros primos, satis difficilem videri, methodumque obiter addigitat, quae forsan illuc conducere possit; multae vero disquisitiones praeliminares necessariae nobis videntur, antequam hacce quidem via ad demonstrationem rigorosam pervenire liceat." (The illustrious Le Gendre himself admits [that] the proof of the theorem — [namely, that] among [integers of] the form kt + l, [where] k and l denote given integers [that are] prime among themselves [i.e., coprime] [and] t denotes a variable, surely prime numbers are contained — seems difficult enough, and incidentally, he points out a method that could perhaps lead to it; however, many preliminary and necessary investigations are [fore]seen by us before this [conjecture] may indeed reach the path to a rigorous proof.) <a href="https://babel.hathitrust.org/cgi/pt?id=nyp.33433070725894;view=1up;seq=527" target="_blank">https://babel.hathitrust.org/cgi/pt?id=nyp.33433070725894;view=1up;seq=527</a> <a href="#fnref:6" class="footnote-back-ref">↩</a></li>
<li id="fn:7">Shiu, D. K. L. (2000). "Strings of congruent primes". J. London Math. Soc. 61 (2): 359–373. doi:10.1112/s0024610799007863. <a href="/wiki/Doi_(identifier)" target="_blank">/wiki/Doi_(identifier)</a> <a href="#fnref:7" class="footnote-back-ref">↩</a></li>
</ol>

Dirichlet's theorem on arithmetic progressions open-in-new

Dirichlet's theorem on arithmetic progressions