Ducci on Zmn and the Maximum Length for n Odd

Abstract

Define the Ducci function D: Zmn Zmn so \[D(x1,x2, ...,xn)=(x1+x2 \;mod \; m, x2+x3 \; mod \; m, ..., xn+x1 \; mod \; m).\] Call \Dα(u)\α=0∞ the Ducci sequence of u. Because Zmn is finite, every Ducci sequence will enter a cycle. In this paper, we will prove that if n is odd and m=2lm1 where m1 is odd, then the longest it will take for a Ducci sequence to enter its cycle is l iterations. Furthermore, we will prove the set of all tuples in a cycle for Zmn is \(x1, x2, ..., xn) ∈ Zmn \; \; x1+x2+ ·s +xn 0 \; mod \; 2l\.

0

Turn this paper into a full lesson

ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…