Asymptotic Improvements of Lower Bounds for the Least Common Multiples of Arithmetic Progressions

preprint2014arXivOpen access

Abstract

For relatively prime positive integers u0u_0 and rr, we consider the least common multiple Ln:=lcm(u0,u1,…,un)L_n:=\mathrm{lcm}(u_0,u_1,\ldots, u_n) of the finite arithmetic progression {uk:=u0+kr}k=0n\{u_k:=u_0+kr\}_{k=0}^n. We derive new lower bounds on LnL_n which improve upon those obtained previously when either u0u_0 or nn is large. When rr is prime, our best bound is sharp up to a factor of n+1n+1 for u0u_0 properly chosen, and is also nearly sharp as n→∞n\to\infty.

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 reviewWrite

No reviews yet.

Discussion 0

Add a commentWrite

No comments yet.