A short note on Jacobsthal's function
Number Theory
2013-06-06 v1
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.
Cite
@article{arxiv.1306.1064,
title = {A short note on Jacobsthal's function},
author = {Fintan Costello and Paul Watts},
journal= {arXiv preprint arXiv:1306.1064},
year = {2013}
}
Comments
4 pages, under submission