A computational upper bound on Jacobsthal's function
classification
🧮 math.NT
keywords
computationalfunctionupperboundboundscalculatingconsecutivecontains
read the original 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).
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.