arXiv · 2410.09138
Resolution of an Erd\H{o}s' problem on least common multiples
Abstract
Erd\H{o}s posed the question whether there exist infinitely many sets of consecutive numbers whose least common multiple (lcm) exceeds the lcm of another, larger set with greater consecutive numbers. In this paper, we answer this question affirmatively by proving that the ratio of the lcm's can be made arbitrarily large.
Explore related subjects
Keep this discovery
Explore connections, maps & timelines
Stijn Cambie. 2024-10-11. Resolution of an Erd\H{o}s' problem on least common multiples. https://arxiv.org/abs/2410.09138
Cite the original work for its findings. Save a collection to share your selection of sources.