Strong Divisibility and LCM-Sequences

Abstract: Let

R

be a gcd-domain (for example let

R

be a unique factorization domain), and let

(a_{n})_{n g e q s l a n t 1}

be a sequence of nonzero elements in

R

. We prove that

g c d (a_{n}, a_{m}) = a_{g c d (n, m)}

for all

n, m g e q s l a n t 1

if and only if

a_n=prodlimits_{dmid n} c_dquadmbox{for} ngeqslant1,

where

c_{1} = a_{1}

and

c_{n} = m b o x l c m (a_{1}, a_{2}, d o t s, a_{n}) / m b o x l c m (a_{1}, a_{2}, d o t s, a_{n - 1})

for

n g e q s l a n t 2

. All equalities with gcd and lcm are determined up to units of

R

.

Cited in

(4)

This page was built for publication: Strong Divisibility and LCM-Sequences