arXiv · 2502.16743
Numerical verification of the Collatz conjecture for billion digit random numbers
Abstract
The Collatz conjecture, also known as the 3n+1 problem, is one of the most popular open problems in number theory. In this note, an algorithm for the verification of the Collatz conjecture is presented that works on a standard PC for numbers with up to ten billion decimal places.
Explore related subjects
Keep this discovery
Andreas-Stephan Elsenhans. 2025-02-23. Numerical verification of the Collatz conjecture for billion digit random numbers. https://arxiv.org/abs/2502.16743
Cite the original work for its findings. Save a collection to share your selection of sources.