A computational upper bound on Jacobsthal's function

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).

arXiv comment13 pages, 3 figures, submitted to Mathematics of Computation

Cited by in corpus (2)

• Algorithmic concepts for the computation of Jacobsthal's function
• Jacobsthal's function and a generalisation of Euler's totient