Every proven n in Collatz Conjecture leads a path to 1. So. there can be a number nmax, below which all numbers have been proven true for Collatz Conjecture. (This can be created computationally). The next immediate number after nmax, np must be a odd integer, because an even integer will immediately be divided into 2 and be send into the pack of proven numbers, as the conjecture dictate.
This odd number np will be move to bigger value to 3np+1. This number being even is divided by 2,
ne=3np+12
this number can be odd or even.
Given that the probability of an even number by the operations in the Conjecture is P(even)=34 and the probability of an odd number after any operation is P(odd)=14.
The expected value for ne is then
E(ne)=3(3np+1)8 when ne is even
E(ne)=3np+18 when ne is odd
These are expected value of (ne) given large numbers where the probability provide good approximation.
The next value of ne when it is even as we apply n2 is,
123(3np+18=3(3np+1)16=9np16+316<np
for large value of nmax, this number is below np and so a proven number.
The next value of ne when it is odd, we apply 3n+1
33np+18+1=9np8+118
as this is always s even number, we divide by 2,
12(9np8+118)=9np16+1116<np.
which is also in the pack below np
As such with a large continuous number of Collatz number, of maximum nmax, as starting point, nmax implies the next integer np is also a Collatz number, then by induction all integer n≥2 are Collatz numbers.
Happy? Be Happy New Year.