4
$\begingroup$

Let $\{a_n\}_{n\in\mathbb{N}}$ be defined as $a_n = a + bn$ for some $a, b >0,(a, b) = 1$. Are there good bounds on the minimal $k$ s.t. $a_k$ is prime. It is well known that there are infinitely many primes in this series,

$\endgroup$
1
  • 7
    $\begingroup$ Search under Linnik's constant. Linnik showed that the least such prime is bounded by $\ll b^{L}$ for a constant $L$, which has been improved over the years, most recently by Xylouris. $\endgroup$
    – Lucia
    Aug 14, 2014 at 17:46

1 Answer 1

10
$\begingroup$

This is Linnik's theorem, and the best known bound is $O(b^5)$ due to Xylouris. (This is in the Wikipedia page, and as I admitted in this year's JMM I added it to the Wikipedia page. It's in his thesis but otherwise unpublished as far as I know.)

$\endgroup$
5
  • 1
    $\begingroup$ If one assumes GRH, then one can obtain much stronger results: see, e.g. Corollary 1.2 of arxiv.org/abs/1309.3595, which shows the strict bound $(\phi(b) \log b)^2$. $\endgroup$ Aug 14, 2014 at 18:46
  • 2
    $\begingroup$ And it is conjectured that much more that even what can be proved using GRH is true, namely that the first prime is O(b^{1+\epsilon}) for all $\epsilon>0$, or perhaps even $O(b \log^2b)$. $\endgroup$
    – Joël
    Aug 14, 2014 at 21:03
  • 1
    $\begingroup$ Xylouris has 5.18 in Xylouris, Triantafyllos, On the least prime in an arithmetic progression and estimates for the zeros of Dirichlet L-functions, Acta Arith. 150 (2011), no. 1, 65–91, MR2825574 (2012m:11129). $\endgroup$ Aug 14, 2014 at 23:25
  • $\begingroup$ @GerryMyerson: Right, but as far as I know the 5.00 is unpublished. $\endgroup$
    – Charles
    Aug 14, 2014 at 23:56
  • 1
    $\begingroup$ I found Xylouris' thesis online: bib.math.uni-bonn.de/downloads/bms/BMS-404.pdf $\endgroup$
    – GH from MO
    Aug 15, 2014 at 0:34

Your Answer

By clicking “Post Your Answer”, you agree to our terms of service and acknowledge you have read our privacy policy.

Not the answer you're looking for? Browse other questions tagged or ask your own question.