A short note on Jacobsthal's function
classification
🧮 math.NT
keywords
functionboundconsecutivecontainscoprimeeveryexplicitgive
read the original 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.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.