2Introduction to Collatz Conjecture Named after Luther CollatzProposed in 1937Unsolved for over 60 yearsAlso known as a bunch of other thingsWondrous numbers3n+1 conjectureUlam conjectureAnd many more
3What is the Collatz Conjecture? Take any natural number n. If n is even, divide n by 2 to obtain (n/2). If n is odd, multiply it by 3 and add 1 to obtain 3n+1. Repeat the process indefinitely. The Conjecture is that no matter what n you start with, you will always eventually reach 1.ex: try doing this starting with n=3
5The Collatz conjecture is the process that eventually every number will reach one. If the conjecture is false it can only be because there exists a starting number which gives rise to a sequence which does not contain 1. This sequence might enter a repeating cycles that excludes one, but no such sequence has been found.
6Hailstone Pseudocode function hailstone(n) while n > 1 show nif n is odd thenset n = 3n + 1elseset n = n / 2endifendwhileMany numbers have been put into the computer program, and every one has reached the number one.
7But what is the Collatz problem? The Collatz conjecture has not been proved nor disprovedEvery number that has been tried has reached the number oneNobody has been able to prove the Collatz conjectureAlthough the conjecture has not been proved most mathematicians believe that it is true, because so many numbers have been tried. In fact every number up to x 1018
8Collatz Conjecture Proofs Indirectly Reverse method: Instead of proving that every natural number leads to one. This method proves that one leads to every natural number Parity Sequence: This can be done because when ever n is odd 3n=1 is even.