Divisibility sequence

From HandWiki
Short description: Type of integer sequence

In mathematics, a divisibility sequence is an integer sequence (an) indexed by positive integers n such that

if mn then aman

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)=agcd(m,n).

Every strong divisibility sequence is a divisibility sequence: gcd(m,n)=m if and only if mn. Therefore, by the strong divisibility property, gcd(am,an)=am and therefore aman.

Examples

  • Any constant sequence is a strong divisibility sequence.
  • Every sequence of the form an=kn, for some nonzero integer k, is a divisibility sequence.
  • The numbers of the form 2n1 (Mersenne numbers) form a strong divisibility sequence.
  • The repunit numbers in any base Rn(b) form a strong divisibility sequence.
  • More generally, any sequence of the form an=AnBn for integers A>B>0 is a divisibility sequence. In fact, if A and B are coprime, then this is a strong divisibility sequence.
  • The Fibonacci numbers Fn form a strong divisibility sequence.
  • More generally, any Lucas sequence of the first kind Un(P,Q) is a divisibility sequence. Moreover, it is a strong divisibility sequence when gcd(P,Q) = 1.
  • Elliptic divisibility sequences are another class of such sequences.

References