An approximation of the Collatz map and a lower bound for the average total stopping time
arXiv:2402.03276
Abstract
Define the map on the positive integers by if is even and by if is odd. Results of Terras and Everett imply that, given any , almost all (in the sense of natural density) fulfill simultaneously for all with . We extend this result to , which is the maximally possible value. Set . As an immediate consequence, one has for almost all for any given . Previously, Korec has shown that for almost all if , and recently Tao proved that for almost all (in the sense of logarithmic density) for all functions diverging to . Denote by the minimal for which if there exists such an and set otherwise. As another application, we show that , partially answering a question of Crandall and Shanks. Under the assumption that the Collatz Conjecture is true in the strong sense that is in , we show that .
New version with changes of exposition of results. An outline of proof of main result added. Approximation result for Syracuse map added. Further references added