Collatz problem: Take any natural number m > 0
n := m
Repeat
if n is odd then n:=3*n+1
else n:=n/2
Until (n==1)
Proof is required that this program terminates after a finite number of steps for every natural number m. This proof should be accepted by the mathematics community on or before the judging date.
None
