Linnik's theorem
{{Short description|Mathematical theorem}}
Linnik's theorem in analytic number theory answers a natural question after Dirichlet's theorem on arithmetic progressions. It asserts that there exist positive c and L such that, if we denote p(a,d) the least prime in the arithmetic progression
:
where n runs through the positive integers and a and d are any given positive coprime integers with 1 ≤ a ≤ d − 1, then:
:
The theorem is named after Yuri Vladimirovich Linnik, who proved it in 1944.{{cite journal | last=Linnik | first=Yu. V. | title=On the least prime in an arithmetic progression I. The basic theorem | journal=Rec. Math. (Mat. Sbornik) |series=Nouvelle Série | volume=15 | issue=57 | year=1944 | pages=139–178 | mr=0012111}}{{ cite journal | last=Linnik | first=Yu. V. | title=On the least prime in an arithmetic progression II. The Deuring-Heilbronn phenomenon | journal=Rec. Math. (Mat. Sbornik) |series=Nouvelle Série | volume=15 | issue=57 | year=1944 | pages=347–368 | mr=0012112}} Although Linnik's proof showed c and L to be effectively computable, he provided no numerical values for them.
It follows from Zsigmondy's theorem that p(1,d) ≤ 2d − 1, for all d ≥ 3. It is known that p(1,p) ≤ Lp, for all primes p ≥ 5, as Lp is congruent to 1 modulo p for all prime numbers p, where Lp denotes the p-th Lucas number. Just like Mersenne numbers, Lucas numbers with prime indices have divisors of the form 2kp+1.
Properties
It is known that L ≤ 2 for almost all integers d.{{cite journal | author1-link=Enrico Bombieri | last1=Bombieri | first1=Enrico | author2-link=John Friedlander | first2=John B. | last2=Friedlander | author3-link=Henryk Iwaniec | first3=Henryk | last3=Iwaniec | title=Primes in Arithmetic Progressions to Large Moduli. III | journal=Journal of the American Mathematical Society | volume=2 | issue=2 | year=1989 | pages=215–224 | mr=0976723 | doi=10.2307/1990976| jstor=1990976 | doi-access=free }}
On the generalized Riemann hypothesis it can be shown that
:
where is the totient function,
and the stronger bound
:
It is also conjectured that:
Bounds for ''L''
The constant L is called Linnik's constant{{cite book |last=Guy | first=Richard K. |title=Unsolved problems in number theory | volume=1 |publisher=Springer-Verlag |edition=Third |year=2004 |isbn=978-0-387-20860-2|page=22 | mr=2076335 | series=Problem Books in Mathematics | doi=10.1007/978-0-387-26677-0 | location=New York}} and the following table shows the progress that has been made on determining its size.
Moreover, in Heath-Brown's result the constant c is effectively computable.