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

DOI10.1016/J.JNT.2006.10.017MaRDI QIDQ996205zbMATH OpenOpenAlexWikidataFDO

Publication date 13 September 2007

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

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

arithmetic progressions least common multiple quadratic sequences

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

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} = a n (n + t) + b

with

(a, t, b) i n {m a t h b b Z}^{3}, a g e q 5, t g e q 0, m g c d (a, b) = 1

. From this, we deduce for instance the lower bound:

m a t h r m l c m 1^{2} + 1, 2^{2} + 1, ..., n^{2} + 1 g e q 0, 32 (1, 442)^{n}

(for all

n g e q 1

). In the last part of this article, we study the integer

m a t h r m l c m (n, n + 1, ..., n + k)

(k i n m a t h b b N, n i n {m a t h b b N}^{*})

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

m a t h r m l c m (n, n + 1, ..., n + k) = d_{n, k}

and

m a t h r m l c m (n, n + 1, ..., n + k) = m_{n, k}

hold for an infinitely many pairs

(n, k)

.

Recommendations

Cites work

Cited in

(42)

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)