An improved algorithm for checking the Collatz conjecture for all n < 2N
Abstract
We describe a new algorithm for verifying the Collatz conjecture for all n < 2N for some fixed N. The algorithm takes less than twice as long to verify convergence for all n < 2N+1 as it does to verify convergence for all n < 2N. We also discuss verification of the analogue of the Collatz conjecture for negative numbers.
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.