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 m and n. 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 m and n,

gcd(am,an)=agcd(m,n),

where gcd is the greatest common divisor function.

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 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. Specific examples include:

  • Any constant sequence an=k is a strong divisibility sequence, which is kUn(1, 0) for n ≥ 1.
  • Every sequence of the form an=kn, for some nonzero integer k, is a divisibility sequence. It is equal to kUn(2, 1).
  • The Fibonacci numbers Fn form a strong divisibility sequence, which is Un(1, −1).
  • The Mersenne numbers an=2n1 form a strong divisibility sequence, which is Un(3, 2).
  • The repunit numbers R(b)n for n = 1, 2, ... in any base b form a strong divisibility sequence, which is Un(b + 1, b).
  • Any sequence of the form an=AnBn for integers A>B>0 is a divisibility sequence, which is (AB)Un(A + B, AB). If A and B are coprime then this is a strong divisibility sequence.

Elliptic divisibility sequences are another class of divisibility sequences.

References