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

DOI10.1016/J.CRMA.2013.10.005zbMATH Open1280.11064arXiv1308.6458OpenAlexW2963073907MaRDI QIDQ387771FDOQ387771

Shaofang Hong, Yuanyuan Luo, Chunlin Wang, Guoyou Qian

Publication date: 17 December 2013

Published in: Comptes Rendus. Mathématique. Académie des Sciences, Paris (Search for Journal in Brave)

Abstract: Let $n$ be a positive integer and $f(x)$ be a polynomial with nonnegative integer coefficients. We prove that ${mlcm}_{lceiln/2ceilleilen}f(i)ge{2}^n$ except that $f(x)=x$ and $n=1,2,3,4,6$ and that $f(x)=x^s$ with $sge2$ being an integer and $n=1$, where $lceiln/2ceil$ 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.

Full work available at URL: https://arxiv.org/abs/1308.6458

Recommendations

• A lower bound on the least common multiple of polynomial sequences
• New lower bounds for the least common multiple of polynomial sequences
• An improved bound on the least common multiple of polynomial sequences
• Least common multiple of polynomial sequences
• On Cilleruelo's conjecture for the least common multiple of polynomial sequences
• On the least common multiple of polynomial sequences at prime arguments
• On the least common multiple of several consecutive values of a polynomial
• Nontrivial lower bounds for the least common multiple of some finite sequences of integers
• The least common multiple of a sequence of products of linear polynomials
• Nontrivial lower bounds for the least common multiple of some sequences of integers.

zbMATH Keywords

polynomial sequenceuniform lower bound

Mathematics Subject Classification ID

Polynomials in number theory (11C08) Special sequences and polynomials (11B83) Multiplicative structure; Euclidean algorithm; greatest common divisors (11A05)

Cites Work

• On Chebyshev-Type Inequalities for Primes
• The least common multiple of a sequence of products of linear polynomials
• Asymptotic behavior of the least common multiple of consecutive arithmetic progression terms
• Note on the lower bound of least common multiple
• New lower bounds for the least common multiples of arithmetic progressions
• Nontrivial lower bounds for the least common multiple of some sequences of integers.
• The least common multiple of consecutive arithmetic progression terms
• Further improvements of lower bounds for the least common multiples of arithmetic progressions
• New results on the least common multiple of consecutive integers
• Title not available (Why is that?)
• A Limit Involving Least Common Multiples: 10797
• On the Product of the Primes
• Lower bounds for the least common multiple of finite arithmetic progressions
• Nontrivial lower bounds for the least common multiple of some finite sequences of integers

Cited In (12)

• On the least common multiple of polynomial sequences at prime arguments
• Nontrivial upper bounds for the least common multiple of an arithmetic progression
• On the sum of reciprocals of least common multiples. II
• The least common multiple of consecutive terms in a cubic progression
• On the least common multiple of binary linear recurrence sequences
• A SHARP UPPER BOUND FOR THE SUM OF RECIPROCALS OF LEAST COMMON MULTIPLES II
• An improved bound on the least common multiple of polynomial sequences
• Nontrivial effective lower bounds for the least common multiple of some quadratic sequences
• The exact upper bound for the sum of reciprocals of least common multiples
• On the sum of reciprocals of least common multiples
• The sum of reciprocals of least common multiples
• New lower bounds for the least common multiple of polynomial sequences

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q387771)