Über Primzahlen in arithmetischen Folgen
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\).
- On Jacobsthal's \(g(n)\)-function
- On the prime numbers of certain arithmetic series.
- Über Primzahlen in arithmetischen Folgen. II
- Über eine zahlentheoretische Funktion von Jacobsthal
- On the order of magnitude of Jacobsthal's function
- Greatest of the Least Primes in Arithmetic Progressions Having a Given Modulus
- Deterministic polynomial factoring and association schemes
- Dirichlet's theorem and Jacobsthal's function
- On relative prime number in a sequence of positive integers
- Über ein Problem in der Theorie der Primzahlen
This page was built for publication: Über Primzahlen in arithmetischen Folgen
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2394564)