Numerical verification of the Collatz conjecture for billion digit random numbers
Number Theory
2025-02-25 v1
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.
Cite
@article{arxiv.2502.16743,
title = {Numerical verification of the Collatz conjecture for billion digit random numbers},
author = {Andreas-Stephan Elsenhans},
journal= {arXiv preprint arXiv:2502.16743},
year = {2025}
}
Comments
4 pages