相关论文: Identities and estimations involving the least com…

This thesis is devoted to studying estimates of the least common multiple of some integer sequences. Our study focuses on effective bounding of the $\mathrm{lcm}$ of some class of quadratic sequences, as well as arithmetic progressions and…

In this paper, we present a method for estimating the least common multiple of a large class of binary linear recurrence sequences. Let $P,Q,R_0$, and $R_1$ be fixed integers and let $\boldsymbol{R}=\left(R_n\right)_{n}$ be the recurrence…

In this paper, we prove the following identity $$ \lcm({n\brack 0}_q,{n\brack 1}_q,...,{n\brack n}_q) =\frac{\lcm([1]_q,[2]_q,...,[n+1]_q)}{[n+1]_q}, $$ where ${n\brack k}_q$ denotes the $q$-binomial coefficient and…

In 1982, Nair proved the identity: ${\rm lcm}({k \choose 1}, 2{k \choose 2}, >..., k{k \choose k}) ={\rm lcm}(1, 2, ..., k), \forall k\in \mathbb{N}.$ Recently, Farhi proved a new identity: ${\rm lcm}({k \choose 0}, {k \choose 1}, >..., {k…

In this paper, we prove the identity $$\lcm\{\binom{k}{0}, \binom{k}{1}, >..., \binom{k}{k}\} = \frac{\lcm(1, 2, ..., k, k + 1)}{k + 1} (\forall k \in \mathbb{N}) .$$ As an application, we give an easily proof of the well-known nontrivial…

Divisibility sequences are defined by the property that their elements divide each other whenever their indices do. The divisibility sequences that also satisfy a linear recurrence, like the Fibonacci numbers, are generated by polynomials…

Let $(F_n)_{n\geq 0}$ be the Fibonacci sequence given by $F_{n+2}=F_{n+1}+F_n$, for $n\geq 0$, where $F_0=0$ and $F_1=1$. There are several interesting identities involving this sequence such as $F_n^2+F_{n+1}^2=F_{2n+1}$, for all $n\geq…

Based on a variant of Sury's polynomial identity we derive new expressions for various finite Fibonacci (Lucas) sums. We extend the results to Fibonacci and Chebyshev polynomials, and also to Horadam sequences. In addition to deriving sum…

Let $a \geq 2$ be an integer. We prove that for every periodic sequence $(s_n)_{n \geq 1}$ in $\{-1, +1\}$ there exists an effectively computable rational number $C_\mathbf{s} > 0$ such that \begin{equation*} \log\operatorname{lcm}(a + s_1,…

Let $(F_n)_{n \geq 1}$ be the sequence of Fibonacci numbers. Guy and Matiyasevich proved that \begin{equation*} \log \operatorname{lcm} (F_1, F_2, \dots, F_n) \sim \frac{3 \log \alpha}{\pi^2} \cdot n^2 \quad \text{as } n \to +\infty,…

We study the typical behavior of the least common multiple of the elements of a random subset $A\subset \{1,\dots, n\}$. For example we prove that $\text{lcm}\{a:\ a\in A\}=2^{n(1+o(1))}$ for almost all subsets $A\subset\{1,\dots,n\}$.

Let $f(x)$ be the product of several linear polynomials with integer coefficients. In this paper, we obtain the estimate: $\log {\rm lcm}(f(1), ..., f(n))\sim An$ as $n\rightarrow\infty $, where $A$ is a constant depending on $f$.

Let $R$ be a gcd-domain (for example let $R$ be a unique factorization domain), and let $(a_n)_{n\geqslant1}$ be a sequence of nonzero elements in $R$. We prove that $\gcd(a_n,a_m)=a_{\gcd(n,m)}$ for all $n,m\geqslant1$ if and only if…

We show that for the classical Fibonacci sequence (Fn) and the Lucas sequence (Ln) the following identity holds for every integer n >= 2: (n-1)Fn equals the sum from k=1 to n-1 of Lk multiplied by F(n-k). Equivalently, this gives a…

In this article, we will discover some new generalized identity regarding continued fractions. We will connect the results to Fibonacci numbers and Lucas numbers. For all the proof, we will use induction.

Let $F_{n}$ and $L_n$ be the $n$th Fibonacci and Lucas number, respectively. For each positive integer $m$, the order of appearance of $m$ in the Fibonacci sequence, denoted by $z(m)$, is the smallest positive integer $k$ such that $m$…

Let $(L_n)_{n \geq 1}$ be the sequence of Lucas numbers, defined recursively by $L_1 := 1$, $L_2 := 3$, and $L_{n + 2} := L_{n + 1} + L_n$, for every integer $n \geq 1$. We determine the asymptotic behavior of $\log \operatorname{lcm} (L_1…

The Fibonacci numbers satisfy the famous recurrence $F_n = F_{n - 1} + F_{n - 2}$. The theory of C-finite sequences ensures that the Fibonacci numbers whose indices are divisible by $m$, namely $F_{mn}$, satisfy a similar recurrence for…

We present numerous interesting, mostly new, results involving the $n$-step Fibonacci numbers and $n$-step Lucas numbers and a generalization. Properties considered include recurrence relations, summation identities, including binomial and…

In this note, we study the divisibility relation $U_m\mid U_{n+k}^s-U_n^s$, where ${\bf U}:=\{U_n\}_{n\ge 0}$ is the Lucas sequence of characteristic polynomial $x^2-ax\pm 1$ and $k,m,n,s$ are positive integers.