Generalized Collatz Maps with Almost Bounded Orbits
From MaRDI portal
Abstract: If dividing by is a mistake, multiply by and translate, and so you'll live to iterate. We show that if we define a Collatz-like map in this form then, under suitable conditions on and , almost all orbits of this map attain almost bounded values. This generalizes a recent breakthrough result of Tao for the original Collatz map (i.e., and ). In other words, given an arbitrary growth function we show that almost every orbit of such map with input eventually attains a value smaller than .
This page was built for publication: Generalized Collatz Maps with Almost Bounded Orbits
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6382781)