arXiv · 1208.5342
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).
Explore related subjects
Keep this discovery
Fintan Costello, Paul Watts. 2012-08-27. A computational upper bound on Jacobsthal's function. https://arxiv.org/abs/1208.5342
Cite the original work for its findings. Save a collection to share your selection of sources.