A short note on Jacobsthal's function

From MaRDI portal




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 page was built for publication: A short note on Jacobsthal's function

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6242440)