Divisibility sequence explained
indexed by
positive integers
n such that
for all m, 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
such that for all positive integers
m,
n,
Every strong divisibility sequence is a divisibility sequence:
if and only if
. Therefore, by the strong divisibility property,
and therefore
.
Examples
- Any constant sequence is a strong divisibility sequence.
- Every sequence of the form
for some nonzero integer
k, is a divisibility sequence.
(
Mersenne numbers) form a strong divisibility sequence.
- The repunit numbers in any base form a strong divisibility sequence.
- More generally, any sequence of the form
for integers
is a divisibility sequence. In fact, if
and
are coprime, then this is a strong divisibility sequence.
References
- Book: Graham. Everest. Alf. van der Poorten. Igor. Shparlinski. Thomas. Ward. Recurrence Sequences. American Mathematical Society. 2003. 978-0-8218-3387-2.
- Marshall. Hall. Divisibility sequences of third order. Am. J. Math.. 1936. 577–584. 58. 3. 10.2307/2370976. 2370976.
- Morgan. Ward. A note on divisibility sequences. Bull. Amer. Math. Soc.. 45. 4. 1939. 334–336. 10.1090/s0002-9904-1939-06980-2. free.
- V. E.. Hoggatt, Jr.. C. T.. Long. Divisibility properties of generalized Fibonacci polynomials. 1973. 113. Fibonacci Quarterly.
- J.-P.. Bézivin. A.. Pethö. A. J.. van der Porten. Am. J. Math.. 112. 6. 1990. 985–1001. A full characterization of divisibility sequences. 10.2307/2374733. 2374733.