Über Primzahlen in arithmetischen Folgen (Q2394564): Difference between revisions

Let \(a\) and \(d\) be natural numbers such that \(a < d\) and \((a, d) = 1\). In a previous note the author conjectured that the arithmetic sequence \(\{a + d, a + 2d, \ldots, a + (d - 1) d\}\) contains at least one prime number [J. Reine Angew. Math. 212, 210--220 (1963; Zbl 0163.29104)]. In this note he proves the conjecture by using a result of Erdős [Math. Scand. 10, 163--170 (1962; Zbl 0202.33002)] about the Jacobsthal function \(g(n)\) which is the smallest natural number such that every section of the sequence of natural numbers of length \(g(n)\) contains at least one number relatively prime to \(n\).