The Period of Ducci Cycles on Z2l for Tuples of Length 2k

Abstract

Let the Ducci function D: Zmn Zmn be defined as \[D(x1, x2, ..., xn)=(x1+x2 \; mod \; m, x2+x3 \; mod \; m, ..., xn+x1 \; mod \; m)\] and let the Ducci sequence of u be the sequence \Dα(u)\α=0∞. %In this paper, we will prove that if n,m are powers of 2, then repeatedly applying D will eventually result in (0,0,...,0), as well as establish an upper bound for how many iterations it will take for this to happen. In this paper, we will provide another proof that for n=2k and m=2l, that all Ducci sequences will end in (0,0,...,0) and additionally prove that this will happen in at most 2k-1(l+1) iterations of D.

0

Turn this paper into a lesson

ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…