Uniform lower bound for the least common multiple of a polynomial sequence
Number Theory
2013-11-25 v2
Abstract
Let be a positive integer and be a polynomial with nonnegative integer coefficients. We prove that except that and and that with being an integer and , where denotes the smallest integer which is not less than . This improves and extends the lower bounds obtained by Nair in 1982, Farhi in 2007 and Oon in 2013.
Cite
@article{arxiv.1308.6458,
title = {Uniform lower bound for the least common multiple of a polynomial sequence},
author = {Shaofang Hong and Yuanyuan Luo and Guoyou Qian and Chunlin Wang},
journal= {arXiv preprint arXiv:1308.6458},
year = {2013}
}
Comments
6 pages. To appear in Comptes Rendus Mathematique