Collatz conjecture
Table of Contents
1. Statement
does every positive number eventually reach 1 by repeatedly applying \[ f(n) = \begin{cases} n/2 & \text{if $n\equiv 0 \pmod{2}$}, \\ 3n + 1 & \text{if $n\equiv 1 \pmod{2}$}. \end{cases} \]
does every positive number eventually reach 1 by repeatedly applying \[ f(n) = \begin{cases} n/2 & \text{if $n\equiv 0 \pmod{2}$}, \\ 3n + 1 & \text{if $n\equiv 1 \pmod{2}$}. \end{cases} \]
Created: 2026-07-16 Thu 21:34