Improved verification limit for the convergence of the Collatz conjecture

This article presents our project, which aims to verify the Collatz conjecture computationally. As a main point of the article, we introduce a new result that pushes the limit for which the conjecture is verified up to $$2^{71}$$ 2 71 . We present our baseline algorithm and then several sub-algorith...

Full description

Saved in:
Bibliographic Details
Published in:The Journal of supercomputing Vol. 81; no. 7; p. 810
Main Author: Barina, David
Format: Journal Article
Language:English
Published: New York Springer Nature B.V 02.05.2025
Subjects:
ISSN:1573-0484, 0920-8542, 1573-0484
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Be the first to leave a comment!
You must be logged in first