A computational upper bound on Jacobsthal's function
Number Theory
2015-03-20 v2
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).
Cite
@article{arxiv.1208.5342,
title = {A computational upper bound on Jacobsthal's function},
author = {Fintan Costello and Paul Watts},
journal= {arXiv preprint arXiv:1208.5342},
year = {2015}
}
Comments
13 pages, 3 figures, submitted to Mathematics of Computation