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.
Connections
Explore this paper’s authors, topics and related work.
Building this map preview
BZPEER is loading the nearby papers, people, topics and institutions for this page.
Reviews 0
Write a review
No reviews yet.
Discussion 0
Add a comment
No comments yet.