Difference between revisions of "Dirichlet's Theorem"
(Created page with "==Theorem== For any positive integers <math>a</math> and <math>m</math> such that <math>(a,m)=1</math>, there exists infinitely many prime <math>p</math> such that <math>p\equiv ...") |
Hashtagmath (talk | contribs) (→Stronger Result) |
||
| Line 10: | Line 10: | ||
</cmath> | </cmath> | ||
where the sum is over all primes <math>p</math> less than <math>x</math> that are congruent to <math>a</math> mod <math>m</math>, and <math>\phi(x)</math> is the [[totient function]]. | where the sum is over all primes <math>p</math> less than <math>x</math> that are congruent to <math>a</math> mod <math>m</math>, and <math>\phi(x)</math> is the [[totient function]]. | ||
| + | |||
| + | ==See Also== | ||
| + | [[Category:Theorems]] | ||
Latest revision as of 12:19, 30 May 2019
Theorem
For any positive integers 
and 
such that 
, there exists infinitely many prime 
such that 
Hence, for any arithmetic progression, unless it obviously contains finitely many primes (first term and common difference not coprime), it contains infinitely many primes.
Stronger Result
For any positive integers and such that ,
![\[\sum_{\substack{p\leq x\\ p\equiv a\mod m}}\frac{1}{p}=\frac{1}{\phi(m)}\log\log x+O(1)\]](http://latex.artofproblemsolving.com/8/0/e/80ef31b95ca7e5263e507c1dc1def8c05ca66183.png)
where the sum is over all primes less than 
that are congruent to mod , and 
is the totient function.
