Ducci sequence: Difference between revisions
statements provably wrong |
m Added an external link after the changes I proposed were adopted by the page owner but not properly credited. |
||
Line 62: | Line 62: | ||
* [http://www.math.jussieu.fr/theses/2002/breuer/homepage/research.html Ducci Sequence] |
* [http://www.math.jussieu.fr/theses/2002/breuer/homepage/research.html Ducci Sequence] |
||
* [http://www.cut-the-knot.org/SimpleGames/IntIter.shtml Integer Iterations on a Circle] |
|||
{{Numtheory-stub}} |
{{Numtheory-stub}} |
Revision as of 15:00, 23 April 2008
A Ducci sequence is a sequence of n-tuples of integers. Given an -tuple of integers a new -tuple is formed by taking the absolute differences: Put another way: Arrange numbers on a circle and make a new circle by taking the difference between them. Ignore any minus signs and repeat the operation.
It has been proven that one will always reach the sequence (0,0,...,0) in a finite number of steps if is a power of 2
With being a finite number, the sequence must of course start repeating itself sooner or later. It has been proven that if is not a power of two, the Ducci sequence will either converge to zeros or settle on a loop with 'binary' sequences. That is, with elements composed of only two different digits.
Example sequences
This 5-tuple sequence enters a period 15 binary 'loop' after 7 iterations.
The following sequence has length 6 which is not a power of two, but it still converges to zeros:
Ducci sequences are also known as the n-numbers game. Numerous extensions and generalisations exist.