All orbits of the collatz map attain the trivial cycle 4 2 1

18 December 2025, Version 1
This content is an early or alternative research output and has not been peer-reviewed by Cambridge University Press at the time of posting.

Abstract

Define the collatz map on the positive integers by setting Col(N)=3N+1 if N is odd and Col(N)=N/2 if N is even,and let Col_min(N) be the minimum of its orbit. The collatz conjecture asserts that Col_min(N)=1 for all N.Recently Terence Tao has shown that for any well-choosen function such that lim_N->∞f(N)=∞ ,one has Col_min(N)

Comments

Comments are not moderated before they are posted, but they can be removed by the site moderators if they are found to be in contravention of our Commenting and Discussion Policy [opens in a new tab] - please read this policy before you post. Comments should be used for scholarly discussion of the content in question. You can find more information about how to use the commenting feature here [opens in a new tab] .
This site is protected by reCAPTCHA and the Google Privacy Policy [opens in a new tab] and Terms of Service [opens in a new tab] apply.
Comment number 1, Dylan MOTIMBA: Dec 20, 2025, 09:39

In this paper we have used the mathematical induction to demonstrate a property of the huts related to the convergence of the syracuse sequences towards the trivial cycle. Let's explain it. First we multiply the terms of the syracuse orbits by 3 and we group these terms into equivalence classes following this relation: l ~l' if k<l<m and k'<l'<m' ,v_2(k)=v_2(k') and v_2(m)=v_2(m') k,k',m,m' multiples of 6 such that m=k+6 and m'=k'+6,l and l' odd multiples of 3 . It is this equivalence class that we call 'hut'. After that we order this set and we apply mathematical induction on a property of its elements related to the convergence of the sequences towards the trivial cycle 4 2 1. For more technical informations,the reader is invited to read the paper,and to temporarily abandon its skepticism .