Generalized Collatz Maps with Almost Bounded Orbits

From MaRDI portal




Abstract: If dividing by p is a mistake, multiply by q 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 p and q, 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., p=2 and q=3). In other words, given an arbitrary growth function Nmapstof(N) we show that almost every orbit of such map with input N eventually attains a value smaller than f(N).












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)