Integer Dynamics
Abstract
Let b ≥ 2 be an integer, and write the base b expansion of any non-negative integer n as n=x0+x1b+…+ xdbd, with xd>0 and 0 ≤ xi < b for i=0,…,d. Let φ(x) denote an integer polynomial such that φ(n) >0 for all n>0. Consider the map Sφ,b: Z≥ 0 Z≥ 0, with Sφ,b(n) := φ(x0)+ … + φ(xd). It is known that the orbit set \n,Sφ,b(n), Sφ,b(Sφ,b(n)), … \ is finite for all n>0. Each orbit contains a finite cycle, and for a given b, the union of such cycles over all orbit sets is finite. Fix now an integer ≥ 1 and let φ(x)=x2. We show that the set of bases b≥ 2 which have at least one cycle of length always contains an arithmetic progression and thus has positive lower density. We also show that a 1978 conjecture of Hasse and Prichett on the set of bases with exactly two cycles needs to be modified, raising the possibility that this set might not be finite.
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.