A short note on Jacobsthal's function

Abstract

The function g(n) represents the smallest number Q such that every sequence of Q consecutive integers contains an integer coprime to n. We give a new and explicit upper bound on this function.

arXiv comment4 pages, under submission

Cited by in corpus (2)

• Algorithmic concepts for the computation of Jacobsthal's function
• Baby-Step Giant-Step Algorithms for the Symmetric Group