On the length of Pierce expansions
Abstract
For a given positive integer n, how long can the process x n (mod x) last before reaching 0? We improve Erdos and Shallit's upper bound of O(n13+) to O(n13-2177+) for any > 0.
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.