Identities and estimations involving the least common multiple of strong divisibility sequences

DOI10.5802/CRMATH.64zbMATH Open1461.11003arXiv1907.06700OpenAlexW3045597993MaRDI QIDQ784231FDOQ784231

Sid Ali Bousla, Bakir Farhi

Publication date: 3 August 2020

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

Abstract: In this paper, we first prove that for any strong divisibility sequences $$, we have the identity: $$ $left(forallngeq1ight)$, generalizing the identity of Farhi (obtained in 2009 for $a_n=n$). Then, we derive from this one some other interesting identities. Finally, we apply those identities to estimate the least common multiple of the consecutive terms of some Lucas sequences. Denoting by $left(F_{n}ight{)}_n$ the usual Fibonacci sequence, we prove for example that for all $ngeq1$, we have [ Phi^{frac{n^2}{4}-frac{9}{4}} leq mathrm{lcm}left(F_1,dots,F_n ight) leq Phi^{frac{n^2}{3}+frac{4n}{3}} , ] where $Phi$ denotes the golden ratio.

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

Mathematics Subject Classification ID

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

Cites Work

• My Numbers, My Friends
• The power of a prime that divides a generalized binomial coefficient.
• A Full Characterisation of Divisibility Sequences
• An Identity Involving the Least Common Multiple of Binomial Coefficients and Its Application
• Title not available (Why is that?)
• An asymptotic formula for \(\pi\)
• Strong Divisibility and LCM-Sequences
• Strong Divisibility, Cyclotomic Polynomials, and Iterated Polynomials
• On the Least Common Multiple of Q-Binomial Coefficients
• Title not available (Why is that?)
• A New Formula for &#960
• Nontrivial effective lower bounds for the least common multiple of some quadratic sequences
• Note on divisibility sequences

Cited In (3)

• Nontrivial upper bounds for the least common multiple of an arithmetic progression
• Nontrivial effective lower bounds for the least common multiple of a $q$-arithmetic progression
• On the least common multiple of binary linear recurrence sequences

This page was built for publication: Identities and estimations involving the least common multiple of strong divisibility sequences

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