Divisibility sequence explained

(an)

indexed by positive integers n such that

ifm\midnthenam\midan

for all mn. That is, whenever one index is a multiple of another one, then the corresponding term also is a multiple of the other term. The concept can be generalized to sequences with values in any ring where the concept of divisibility is defined.

A strong divisibility sequence is an integer sequence

(an)

such that for all positive integers mn,

\gcd(am,an)=a\gcd(m,n).

Every strong divisibility sequence is a divisibility sequence:

\gcd(m,n)=m

if and only if

m\midn

. Therefore, by the strong divisibility property,

\gcd(am,an)=am

and therefore

am\midan

.

Examples

an=kn,

for some nonzero integer k, is a divisibility sequence.

2n-1

(Mersenne numbers) form a strong divisibility sequence.

an=An-Bn

for integers

A>B>0

is a divisibility sequence. In fact, if

A

and

B

are coprime, then this is a strong divisibility sequence.

References