![MathJax Logo](/templates/jsp/_style2/_tandf/pb2/images/math-jax.gif)
Abstract
Dirichlet’s theorem on primes in arithmetic progressions states that for any positive integer q and any coprime integer a, there are infinitely many primes in the arithmetic progression a + nq (). Unfortunately, the theorem does not predict the gap between those primes. Several renowned open questions such as the size of Linnik’s constant try to say more about the distribution of such primes. This manuscript postulates a weak, but explicit, generalization of Linnik’s theorem, namely that each geometric interval
contains a prime from each coprime congruence class modulo
. Subsequently, it proves the conjecture theoretically for all sufficiently large t, as well as computationally for all sufficiently small q. Finally, the impact of this conjecture on a result of Pomerance related to Carmichael’s conjecture is outlined.
1 An explicit generalization of Linnik’s theorem
Dirichlet’s theorem on primes in arithmetic progressions [Citation7] is the direct generalization of Euclid’s theorem on the infinity of primes to the setting of arithmetic progressions. Sadly, both of those theorems are purely existential and do not hint at the exact distribution of primes; a fact that has already puzzled mathematicians for several centuries. A first milestone was achieved in 1896 when the Prime Number Theorem describing the asymptotic distribution of primes was independently proven by Hadamard and De la Vallée Poussin. Shortly after, De la Vallée Poussin generalized his findings to primes in arithmetic progressions, indicating that the primes are evenly distributed among the coprime congruence classes. Over the last century, many mathematicians improved the asymptotic limits for the distribution of primes and outlined explicit computational bounds. Whereas the picture slowly clarifies for primes in general, there are not many explicit results for primes in arithmetic progressions. In fact, their study turns out to be extremely challenging if short intervals are involved. One example of this is the strenuous quest for predicting the size of the smallest prime in an arithmetic progression. An amazing result in this direction was achieved by Linnik in 1944 with the following theorem ([Citation10, Citation11]).
Theorem 1
(Linnik). There are absolute constants C and L such that for any and any
with
, the smallest prime
does not exceed CqL.
Although Linnik did not write out his predicted constants C and L, his development showed them to be effectively computable. Today, the infimum over all possible absolute constants L for which Theorem 1 holds is known as Linnik’s constant. After several years of research, the best unconditional upper bound for Linnik’s constant is [Citation14] and under GRH one may conclude that any constant L > 2 is admissible [Citation6]. Nonetheless, aligned with Schinzel’s conjecture H2 [Citation13], the detailed survey [Citation9] conjectures the upper bound
and [Citation3] shows that this actually holds for almost all moduli. After discussing the smallest prime in an arithmetic progression, one may go on and ask about the subsequent primes. Setting C = 1 and varying only the exponent in Theorem 1 leads to the following conjecture.
Conjecture 2. For any positive integers with
, and
, there exists a prime p such that
(1)
(1)
Of course, if primes smaller than q are allowed and t = 1, one recovers the conjecture on the size of Linnik’s constant. Consequently, it is not surprising that Conjecture 2 is extremely difficult to prove for small exponents. However, the picture changes when t increases. Indeed, the expansion of these geometric intervals is faster than the decrease of the occurrence of primes. Thus, for sufficiently large t, the interval will contain many primes of the desired form. One could even shrink the considered intervals and still conclude that they contain one prime from each congruence class. Whereas this is the main focus of most recent asymptotic results, Conjecture 2 is meant to be fully explicit without any hidden constants. Although it does not reflect the optimal interval length for the existential conclusion, it gives a practical range for retrieving such primes. Furthermore, it is deeply connected with other classical results such as Bertrand’s postulate, which can be obtained by considering q = 2.
Remark 3.
For the sake of clarity, the upcoming development relies on explicit results only.
2 A partial proof for Conjecture 2
Recent explicit results on the distribution of primes in arithmetic progressions allow a partial proof of Conjecture 2. Indeed, the article [Citation2], accompanied by an enormous computational data set, gives explicit bounds for the number of primes in bounded arithmetic progressions.
Theorem 4
(Bennett, Martin, O’Bryant, Rechnitzer). Let be an integer, let a be an integer that is coprime to q, and let
denote the Euler totient function. Furthermore, let θ denote the first Chebyshev prime counting function for arithmetic progressions defined by
where the sum runs over all primes
congruent to a modulo q. Then there exist explicit constants
and
such that
Moreover, and
satisfy
and
, where
Theorem 4
gives rise to an explicit lower bound for the exponents for which Conjecture 2 will hold, that is(2)
(2)
Lemma 5.
Let with
and
. Then there exists a prime p such that
and
.
Proof.
By assumption , and so
. Thus, Theorem 4 yields a lower bound for
and an upper bound for
. Combining these bounds leads to the following inequalities:
As , the last quantity is nonnegative, which guarantees the existence of a prime
such that
. □
Although varies with q, Lemma 5 implies that for a fixed
Conjecture 2 holds except maybe for finitely many exponents, namely for
. Using the explicit lists of constants
and
from [Citation2] published at http://www.nt.math.ubc.ca/BeMaObRe/, one can computationally verify the conjecture for those finitely many missing exponents. A verification for all
can be found at https://files.uni.lu/jim.barthel/PrimesInAP/ and leads to the following conclusion.
Lemma 6.
Let with
, and
. Then there exists a prime p such that
and
.
Using SageMath and its built-in Pari-GP function isprime(), the verification program computed for each modulus and each coprime remainder
an explicit list L(q, a) of primes
verifying
and
for all
. These lists of primes are freely accessible and can also be used for other statistical analyses of primes in arithmetic progressions. Simultaneously, this verification guarantees correctness of the conjectured size of Linnik’s constant for all
.
Remark 7.
Let li denote the logarithmic integral defined by . Let π denote the usual prime counting function for arithmetic progressions defined by
where the sum runs over all primes
congruent to a modulo q. Assuming the Extended Riemann Hypothesis, [Citation1, Theorem 8.8.18] shows that
Using those conditional bounds, one can show that Conjecture 2 holds for all when
, and even for t = 2 when q is sufficiently large (i.e.,
). Thus, under the Extended Riemann Hypothesis, only the conjectured bound
for Linnik’s constant remains to be proven.
3 A Consequence for Carmichael’s conjecture
Conjecture 2 is indirectly linked to Carmichael’s totient function conjecture ([Citation4, Citation5]). Before explaining this link, a short summary of this conjecture is required.
Conjecture 8 (Carmichael). Let denote the Euler totient function. For a given number n, the equation
either has no solution at all or it has at least two solutions.
Correctness of the conjecture has already been proven for all [Citation8], but the existence of a counterexample has not yet been ruled out for larger values. The only known attempt for constructing a counterexample has been developed by Pomerance in [Citation12]. His construction relies on the following observation.
Theorem 9
(Pomerance). If x is a natural number such that for every prime p, implies
, then
has only the trivial solution y = x.
However, Pomerance also points out that likely such a counterexample does not exist. In particular, he shows that if the following conjecture holds, then there cannot be a counterexample as it would necessarily be divisible by every single prime.
Conjecture 10 (Pomerance). If , then
, where pi denotes the i-th prime.
Translating Pomerance’s conjecture in terms of primes in arithmetic progressions with remainder 1 and comparing it with Conjecture 2 finally reveals the acclaimed link.
Proposition 11.
If Conjecture 2 holds, then Pomerance’s conjecture holds, and hence there does not exist a counterexample to Carmichael’s conjecture based on Theorem 9.
Proof.
Assume Conjecture 2 holds, and let . In order to prove that
, it is sufficient to show that
for all
where
denotes the q-adic valuation map defined by
and
. Indeed, any prime divisor of
is smaller than pk and the valuation map outlines its highest power, granting an easy comparison of divisors. Accordingly, let
, then
for some
. Thus
. If t = 0, then the claim is trivial. If t > 0, Conjecture 2 yields
where the last inequality follows from Conjecture 2’s claim that for all
there is a prime p such that
and
. □
As Conjecture 2 holds for all , Pomerance’s conjecture holds for a non-negligible proportion of all primes.
Corollary 12.
Pomerance’s conjecture holds for any prime pk such that the largest square factor of is 45000-smooth.
Proof.
Pomerance’s conjecture trivially holds whenever is squarefree. Thus assume that
where B is 45000-smooth and χ is squarefree. Regrouping the prime factors gives
where
is 45000-smooth and
is either equal to 1 or squarefree with smallest prime factor larger than 45000. In both cases,
is trivially divisible by
. Furthermore, the same valuation argument as used in the proof of Proposition 11 shows that also
, which concludes the proof. □
Remark 13.
Proposition 11 does not contradict the general existence of a counterexample of Carmichael’s conjecture, but it only rules out counterexamples stemming from Theorem 9. Corollary 12 thus strengthens the correctness of Carmichael’s conjecture but is not sufficient to prove it.
Acknowledgment
The authors wish to thank the editors and the anonymous referees for their helpful suggestions. The first author was supported in part by the Luxembourg National Research Fund through grant PRIDE15/10621687/SPsquared.
Additional information
Funding
References
- Bach, E., Shallit, J. (1996). Algorithmic Number Theory, Vol. 1: Efficient Algorithms. Cambridge, MA: MIT Press.
- Bennett, A. M., Martin, G., O’Bryant, K., Rechnitzer, A. (2018). Explicit bounds for primes in arithmetic progressions. Illinois J. Math. 62(1–4): 427–532. DOI: 10.1215/ijm/1552442669.
- Bombieri, E., Friedlander, J. B., Iwaniec, H. (1989). Primes in arithmetic progressions to large moduli. III. J. Amer. Math. Soc. 2(2): 215–224. DOI: 10.1090/S0894-0347-1989-0976723-6.
- Carmichael, R. D. (1907). On Euler’s ϕ-function. Bull. Amer. Math. Soc. 13(5): 241–243. DOI: 10.1090/S0002-9904-1907-01453-2.
- Carmichael, R. D. (1922). Note on Euler’s φ-function. Bull. Amer. Math. Soc. 28(3): 109–110. DOI: 10.1090/S0002-9904-1922-03504-5.
- Chowla, S. (1934). On the least prime in an arithmetical progression. Acta Arith. 1(2): 1–3.
- Dirichlet, P. G. L. (1837). Beweis des Satzes, dass jede unbegrenzte arithmetische Progression, deren erstes Glied und Differenz ganze Zahlen ohne gemeinschaftlichen Factor sind, unendlich viele Primzahlen enthält. Abh. K. Preuss. Akad. Wiss. 45–81.
- Ford, K. (1998). The distribution of totients. Ramanujan J. 2(1–2): 67–151. doi.org/ DOI: 10.1023/A:1009761909132.
- Heath-Brown, D. R. (1992). Zero-free regions for Dirichlet L-functions, and the least prime in an arithmetic progression. Proc. London Math. Soc. 64(2): 265–338. DOI: 10.1112/plms/s3-64.2.265.
- Linnik, U. V. (1944). On the least prime in an arithmetic progression. I. The basic theorem. Rec. Math. [Mat. Sbornik] N.S. 15(57): 139–178. mi.mathnet.ru/eng/msb6196
- Linnik, U. V. (1944). On the least prime in an arithmetic progression. II. The Deuring-Heilbronn phenomenon. Rec. Math. [Mat. Sbornik] N.S. 15(57): 347–368. mi.mathnet.ru/eng/msb6202
- Pomerance, C. (1974). On Carmichael’s conjecture. Proc. Amer. Math. Soc. 43(2): 297–298. DOI: 10.1090/S0002-9939-1974-0340161-0.
- Schinzel, A., Sierpiński, W. (1958). Sur certaines hypothèses concernant les nombres premiers. Acta Arith. 4(3): 185–208. eudml.org/doc/206115
- Xylouris, T. (2018). Linniks Konstante ist kleiner als 5.Chebyshevskii Sb. 19(3): 80–94. DOI: 10.22405/2226-8383-2018-19-3-80-94.