🌀 Collatz Conjecture Explorer

Take any positive whole number: halve it if even, triple-and-add-one if odd. Every number ever tried falls into the 4-2-1 loop — nobody has proved why. Chart any starting value (BigInt-sized), measure its stopping time and peak, and scan ranges for the longest-running chains.

Start value n

The first steps

—

Range scan — who resists the longest?

Every integer in [from, to] gets walked to 1 (double-precision; up to a span of 5,000).

from