Abstract
For relatively prime positive integers and , we consider the least common multiple of the finite arithmetic progression . We derive new lower bounds on which improve upon those obtained previously when either or is large. When is prime, our best bound is sharp up to a factor of for properly chosen, and is also nearly sharp as .
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.