Related papers: On the least common multiple of binary linear recu…

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…

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…

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\}$.

In this paper, we first prove that for any strong divisibility sequences $\boldsymbol{a} = \left(a_n\right)_{n\geq 1}$, we have the identity: $\mathrm{lcm} \left\lbrace \binom{n}{0}_{\bf{a}}, \binom{n}{1}_{\bf{a}},\dots,…

This paper is devoted to establish nontrivial effective lower bounds for the least common multiple of consecutive terms of a sequence ${(u_n)}_{n \in \mathbb{N}}$ whose general term has the form $u_n = r {[n]}_q + u_0$, where $q , r$ are…

This paper is devoted to studying the numbers $L_{c,m,n} := \mathrm{lcm}\{m^2+c ,(m+1)^2+c , \dots , n^2+c\}$, where $c,m,n$ are positive integers such that $m \leq n$. Precisely, we prove that $L_{c,m,n}$ is a multiple of the rational…

For every positive integer $n$ and for every $\alpha \in [0, 1]$, let $\mathcal{B}(n, \alpha)$ denote the probabilistic model in which a random set $\mathcal{A} \subseteq \{1, \dots, n\}$ is constructed by picking independently each element…

Let $B_n(m)$ be a set picked uniformly at random among all $m$-elements subsets of $\{1,2,\ldots,n\}$. We provide a pathwise construction of the collection $(B_n(m))_{1\leq m\leq n}$ and prove that the logarithm of the least common multiple…

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,…

For relatively prime positive integers $u_0$ and $r$, we consider the least common multiple $L_n:=\mathrm{lcm}(u_0,u_1,\ldots, u_n)$ of the finite arithmetic progression $\{u_k:=u_0+kr\}_{k=0}^n$. We derive new lower bounds on $L_n$ which…

In this paper, we establish some nontrivial and effective upper bounds for the least common multiple of consecutive terms of a finite arithmetic progression. Precisely, we prove that for any two coprime positive integers $a$ and $b$, with…

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…

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$.

For any irreducible quadratic polynomial f(x) in Z[x] we obtain the estimate log l.c.m.(f(1),...,f(n))= n log n + Bn + o(n) where B is a constant depending on f.

Let $L_{n}$ be the least common multiple of a random set of integers obtained from $\{1,\ldots,n\}$ by retaining each element with probability $\theta\in (0,1)$ independently of the others. We prove that the process $(\log L_{\lfloor…

We study a recursively defined sequence which is constructed using the least common multiple. It has been conjectured that every term of that sequence is $1$ or a prime. In this paper we show that this claim is connected to a strong version…

For every positive integer $n$ and every $\delta \in [0,1]$, let $B(n, \delta)$ denote the probabilistic model in which a random set $A \subseteq \{1, \dots, n\}$ is constructed by choosing independently every element of $\{1, \dots, n\}$…

When studying the least common multiple of some finite sequences of integers, the first author introduced the interesting arithmetic functions $g_k$ $(k \in \mathbb{N})$, defined by $g_k(n) := \frac{n (n + 1) ... (n + k)}{\lcm(n, n + 1,…

Let $L_n(k)$ denote the least common multiple of $k$ independent random integers uniformly chosen in $\{1,2,\ldots ,n\}$. In this note, using a purely probabilistic approach, we derive a criterion for the convergence in distribution as…

A nearly linear recurrence sequence (nlrs) is a complex sequence $(a_n)$ with the property that there exist complex numbers $A_0$,$\ldots$, $A_{d-1}$ such that the sequence $\big(a_{n+d}+A_{d-1}a_{n+d-1}+\cdots +A_0a_n\big)_{n=0}^{\infty}$…