Uniform lower bound for the least common multiple of a polynomial sequence

Publication date 17 December 2013

Abstract: Let

n

be a positive integer and

f (x)

be a polynomial with nonnegative integer coefficients. We prove that

{m l c m}_{l c e i l n / 2 c e i l l e i l e n} f (i) g e 2^{n}

except that

f (x) = x

and

n = 1, 2, 3, 4, 6

and that

f (x) = x^{s}

with

s g e 2

being an integer and

n = 1

, where

l c e i l n / 2 c e i l

denotes the smallest integer which is not less than

n / 2

. This improves and extends the lower bounds obtained by Nair in 1982, Farhi in 2007 and Oon in 2013.

Recommendations

Cites work

Cited in

(16)

This page was built for publication: Uniform lower bound for the least common multiple of a polynomial sequence