Open Access Open Access  Restricted Access Subscription Access
Open Access Open Access Open Access  Restricted Access Restricted Access Subscription Access

On the Least Prime in an Arithmetical Progression


     

   Subscribe/Renew Journal


Let k and l be integers prime to each other, of which k is positive. Dirichlet proved that there are infinitely many primes in the arithmetical progression kx+l. If P(k, l) is the least prime of this form it is probable that P(k, l)<k1+ε for every positive ε and all large k. We are very far at present even from being able to show that P(k, l) < km where m is any fixed positive constant independent of k, which is large. However if we assume the truth of the so-called "extended Riemann hypothesis" we can (1) show that P(k, l)<k2+ε for k > k0 (ε).
Subscription Login to verify subscription
User
Notifications
Font Size


Abstract Views: 223

PDF Views: 0




  • On the Least Prime in an Arithmetical Progression

Abstract Views: 223  |  PDF Views: 0

Authors

Abstract


Let k and l be integers prime to each other, of which k is positive. Dirichlet proved that there are infinitely many primes in the arithmetical progression kx+l. If P(k, l) is the least prime of this form it is probable that P(k, l)<k1+ε for every positive ε and all large k. We are very far at present even from being able to show that P(k, l) < km where m is any fixed positive constant independent of k, which is large. However if we assume the truth of the so-called "extended Riemann hypothesis" we can (1) show that P(k, l)<k2+ε for k > k0 (ε).