Numerical verification of the Collatz conjecture for billion digit random numbers

2025/02/23 by Elsenhans, Andreas-Stephan
#11Y55 #FOS: Mathematics #Number Theory (math.NT)

paper · doi:10.48550/arxiv.2502.16743

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.

Related

• Verification of Collatz Conjecture: An algorithmic approach based on binary representation of integers
• An Alternative Computational Approach to the Collatz Conjecture
• Novel Theorems and Algorithms Relating to the Collatz Conjecture
• A Proof for the Collatz Conjecture
• An Engineering and Statistical Look at the Collatz (3n + 1) Conjecture