Proof of Collatz Theorem Pure & Simple Way!
Proof of Collatz Theorem Pure & Simple Every Number That is equalized to the power of 2 Reaches To One (GOD) 3n+b ==> an + b ==> (2x+1)m + 2y +1 = 2^k , y < (2^(k-1) -1) Collatz Theorem : Any positive integer divide by 2 if it's even, and multiply by 3 if it's odd and add 1, you'll always get 1. Collatz's Proof: When the odd number in the Collatz set is equalized to the power of 2 , that is, when an + b = 2^k, each number is divisible by 2 and always reaches 1. a element of (except 0) Natural Odd Numbers n and m elements of (except 0) All Natural Numbers b element of (except 0) Z {..-5,-3,-1,1,3,5,7...} +/- Odd numbers k elements of (except 0) N {1,2,3,4...} All Natural Numbers an+b = 2^(k) x, m, k elements of N (excluding zero) {1,2,3,4...} y element of Z {..-5,-4,-3,-2,-1,0,1,2,3,4,5,7...} x and y < 2^(k-1) a=2x+1, n=m, b=2y+1 a * n +...