Nontrivial lower bounds for the least common multiple of some finite sequences of integers

DOI10.1016/J.JNT.2006.10.017zbMATH Open1124.11005arXiv0803.0290OpenAlexW2964128110WikidataQ57256073 ScholiaQ57256073MaRDI QIDQ996205FDOQ996205

Authors: Bakir Farhi 

Publication date: 13 September 2007

Published in: Journal of Number Theory (Search for Journal in Brave)

Abstract: We present here a method which allows to derive a nontrivial lower bounds for the least common multiple of some finite sequences of integers. We obtain efficient lower bounds (which in a way are optimal) for the arithmetic progressions and lower bounds less efficient (but nontrivial) for quadratic sequences whose general term has the form $u_n=an(n+t)+b$ with $(a,t,b)in{mathbbZ}^3,ageq5,tgeq0,mgcd(a,b)=1$. From this, we deduce for instance the lower bound: $mathrmlcm{1}^2+1,2^2+1,\mathrm{...},n^2+1geq0,32(1,442{)}^n$ (for all $ngeq1$). In the last part of this article, we study the integer $mathrmlcm(n,n+1,\mathrm{...},n+k)$ $(kinmathbbN,nin{mathbbN}^{\ast })$. We show that it has a divisor $d_{n,k}$ simple in its dependence on $n$ and $k$, and a multiple $m_{n,k}$ also simple in its dependence on $n$. In addition, we prove that both equalities: $mathrmlcm(n,n+1,\mathrm{...},n+k)=d_{n,k}$ and $mathrmlcm(n,n+1,\mathrm{...},n+k)=m_{n,k}$ hold for an infinitely many pairs $(n,k)$.

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

Recommendations

• Note on the lower bound of least common multiple
• Nontrivial lower bounds for the least common multiple of some sequences of integers.
• Asymptotic improvements of lower bounds for the least common multiples of arithmetic pro\-gressions
• New lower bounds for the least common multiple of polynomial sequences
• Nontrivial effective lower bounds for the least common multiple of a \(q\)-arithmetic progression

zbMATH Keywords

arithmetic progressionsleast common multiplequadratic sequences

Mathematics Subject Classification ID

Special sequences and polynomials (11B83) Multiplicative structure; Euclidean algorithm; greatest common divisors (11A05)

Cites Work

• Title not available (Why is that?)
• On Chebyshev-Type Inequalities for Primes
• On the Product of the Primes

Cited In (42)

• On the error term of the logarithm of the lcm of a quadratic sequence
• Further results on a curious arithmetic function
• On the least common multiple of several consecutive values of a polynomial
• Integral Difference Ratio Functions on Integers
• Lower bounds for the least common multiple of finite arithmetic progressions
• Notes on a curious arithmetic function
• Nontrivial upper bounds for the least common multiple of an arithmetic progression
• The least common multiple of consecutive terms in a quadratic progression
• Cooperative Boolean systems with generically long attractors I
• Verifying whether one-tape Turing machines run in linear time
• 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
• On the periodicity of some Farhi arithmetical functions
• 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
• New lower bounds for the least common multiples of arithmetic progressions
• Nontrivial lower bounds for the least common multiple of some sequences of integers.
• Title not available (Why is that?)
• Nontrivial effective lower bounds for the least common multiple of a \(q\)-arithmetic progression
• On the least common multiple of Lucas subsequences
• Improvements of lower bounds for the least common multiple of finite arithmetic progressions
• The least common multiple of consecutive arithmetic progression terms
• Jeu-de-taquin promotion and a cyclic sieving phenomenon for semistandard hook tableaux
• Nontrivial effective lower bounds for the least common multiple of some quadratic sequences
• Further improvements of lower bounds for the least common multiples of arithmetic progressions
• New results on the least common multiple of consecutive integers
• The exact upper bound for the sum of reciprocals of least common multiples
• On the sum of reciprocals of least common multiples
• On the lcm-analog of binomial coefficient
• A sharp upper bound for the sum of reciprocals of least common multiples
• On the least common multiple of several random integers
• The sum of reciprocals of least common multiples
• Sequences with bounded l.c.m. of each pair of terms II
• 2D Lyndon words and applications
• Uniform lower bound for the least common multiple of a polynomial sequence
• Newton representation of functions over natural integers having integral difference ratios
• On the periodicity of an arithmetical function
• New lower bounds for the least common multiple of polynomial sequences

This page was built for publication: Nontrivial lower bounds for the least common multiple of some finite sequences of integers

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