An upper bound on Jacobsthal's function
From MaRDI portal
Abstract: The function h(k) represents the smallest number m such that every sequence of m consecutive integers contains an integer coprime to the first k primes. We give a new computational method for calculating strong upper bounds on h(k).
Recommendations
Cites work
- A note on the least prime in an arithmetic progression
- Computation of Jacobsthal's function \(h(n)\) for \(n<50\).
- Disproof of a conjecture of Jacobsthal
- On a problem of Pillai and its generalizations
- On Jacobsthal's \(g(n)\)-function
- On the Integers Relatively Prime to n and a Number-Theoretic Function Considered by Jacobsthal.
- ON THE PROBLEM OF JACOBSTHAL
- Über eine zahlentheoretische Funktion von Jacobsthal
- Unusually Large Gaps Between Consecutive Primes
- Very large gaps between consecutive primes
Cited in
(8)- On Jacobsthal's \(g(n)\)-function
- The upper bound of Frobenius related length functions
- Disproof of a conjecture of Jacobsthal
- Computation of Jacobsthal's function \(h(n)\) for \(n<50\).
- Upper and Lower Bounds for a Function Related to Brown's Lemma
- scientific article; zbMATH DE number 4173120 (Why is no real title available?)
- Dirichlet's theorem and Jacobsthal's function
- A polynomial analogue of Jacobsthal function
This page was built for publication: An upper bound on Jacobsthal's function
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5179228)
