For those that are unfamiliar to the Collatz Conjecture, it's known as the simplest unsolved problem in mathematics. The process involves choosing some positive integer as input, halving the number if it's even, tripling and adding 1 if it's odd, and continuing until you reach 1. The conjecture is that, no matter which starting number you choose, the process always eventually reaches 1. There's two ways this could be false, which I'll denote as the "Escape Hypothesis" and the "Cycle Hypothesis". Here, I'll show you that the Escape Hypothesis is false.
A big point to notice that, once you reach an odd number, it goes into the 3x+1 step, but then it becomes even, so it then goes into the x/2 step at least once. This means the most an odd number can grow is 3/2 times bigger (the +1 becomes irrelevant at large scales). For a number to grow by that much, it has to be in the form of 8k+7 (7 -> 11, both steps in one). For it to grow two times that, it has to be in the form of 16k+15 (15 -> 23 -> 35). Three steps requires the number to be 32k+31, and so on.
This can be generalized to this mod formula for n: n = (8*2^a)k+(8*2^a)-1, which can be rewritten as: n+1=(8*2^a)*(k+1) (a is the number of times that type of number can grow minus 1) Plugging in every whole number for a (0, 1, 2, 3,...), this means the following:
For a=0, n+1 must be divisible by 8
For a=1, n+1 must be divisible by 16
For a=2, n+1 must be divisible by 32
For a=3, n+1 must be divisible by 64, and so on
This means that for some number n to escape, n+1 has to be divisible by 8, 16, 32, 64, and so on for every power of 2. The only finite number that satisfies all of these conditions is 0, meaning the only number that can escape is n=-1. However, the initial conjecture was only about positive integers. Thus, it's impossible for any number to escape in the Collatz Conjecture. Q.E.D.