{"paper":{"title":"Ducci on $\\mathbb{Z}_m^n$ and the Maximum Length for $n$ Odd","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["math.GR"],"primary_cat":"math.NT","authors_text":"Mark L. Lewis, Shannon M. Tefft","submitted_at":"2024-03-08T13:49:42Z","abstract_excerpt":"Define the Ducci function $D: \\mathbb{Z}_m^n \\to \\mathbb{Z}_m^n$ so \\[D(x_1,x_2, ...,x_n)=(x_1+x_2 \\;\\text{mod} \\; m, x_2+x_3 \\; \\text{mod} \\; m, ..., x_n+x_1 \\; \\text{mod} \\; m).\\]\n  Call $\\{D^{\\alpha}(\\mathbf{u})\\}_{\\alpha=0}^{\\infty}$ the Ducci sequence of $\\mathbf{u}$. Because $\\mathbb{Z}_m^n$ is finite, every Ducci sequence will enter a cycle. In this paper, we will prove that if $n$ is odd and $m=2^lm_1$ where $m_1$ 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 $\\mathbb{Z}_m"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2403.05319","kind":"arxiv","version":2},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2403.05319/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"references":{"count":0,"sample":[],"resolved_work":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","internal_anchors":0},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"author_claims":{"count":0,"strong_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"builder_version":"pith-number-builder-2026-05-17-v1"}