In the Collatz sequence the number of steps of (3n+1)/2 that a number makes before it is divisible by two more than once is equal to the number of times that you can do (n-1)/2 while landing on an odd number. This means that we can do 2n+1 to increase the number of steps. If we could prove that a...