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
1 @ 1 Jonathan Kaplan (4493) 2 @ 1 JohnMonroe (286) 500 @ 1 Geronimo Jones (2986) 245 @ 2 Geronimo Jones (2986)
10 @ 25 CRGreathouse (6805) 10 @ 26 CRGreathouse (6805) 10 @ 27 CRGreathouse (6805) 10 @ 28 GherkinTsunami (10210) 117 @ 30 tucker (303) 5 @ 35 twist (9973) 9 @ 37 twist (9973) 11 @ 38 twist (9973) 318 @ 90 abliss (4969) 30 @ 90 tWD (3601) 13 @ 95 Karl Hallowell (73) 22 @ 97 Karl Hallowell (73) 1 @ 99 crandles (7886)