Dirichlet's Theorem and Jacobsthal's Function

2017/08/17 by Idris Mercer, Mercer, Idris · 1 citation
Physics and Astronomy · Mathematics · Computer Science · #Advanced Mathematical Theories and Applications #Advanced Combinatorial Mathematics #Graph Labeling and Dimension Problems

paper · pdf · doi:10.48550/arxiv.1708.05415

Abstract

If a and d are relatively prime, we refer to the set of integers congruent to a mod d as an `eligible' arithmetic progression. A theorem of Dirichlet says that every eligible arithmetic progression contains infinitely many primes; the theorem follows from the assertion that every eligible arithmetic progression contains at least one prime. The Jacobsthal function g(n) is defined as the smallest positive integer such that every sequence of g(n) consecutive integers contains an integer relatively prime to n. In this paper, we show by a combinatorial argument that every eligible arithmetic progression with d≤76 contains at least one prime, and we show that certain plausible bounds on the Jacobsthal function of primorials would imply that every eligible arithmetic progression contains at least one prime. That is, certain plausible bounds on the Jacobsthal function would lead to an elementary proof of Dirichlet's theorem.

Citations

• Algorithmic concepts for the computation of Jacobsthal's function

Cited by

• New computational results on a conjecture of Jacobsthal

Related

• An alternative proof of the Dirichlet prime number theorem
• Formalization of the prime number theorem and Dirichlet's theorem
• A new proof of Dirichlet's theorem concerning prime numbers in arithmetic progressions
• A computational upper bound on Jacobsthal's function
• There are infinitely many prime numbers in all arithmetic progressions with first term and difference coprime