Efficient Computation of Collatz Sequence Stopping Times: A Novel Algorithmic Approach

The Collatz conjecture, which posits that any positive integer will eventually reach 1 through a specific iterative process, is a classic unsolved problem in mathematics. This research focuses on designing an efficient algorithm to compute the stopping time of numbers in the Collatz sequence, achiev...

Full description

Saved in:

Bibliographic Details
Published in:	IEEE access Vol. 13; pp. 41210 - 41220
Main Authors:	Getachew, Eyob Solomon, Assefa, Beakal Gizachew
Format:	Journal Article
Language:	English
Published:	IEEE 2025
Subjects:	Algorithm optimization and large-scale verification Approximation algorithms bitwise operations Collatz conjecture Collatz tree Complexity theory computational complexity Computational efficiency computational mathematics Encryption high-performance algorithms logarithmic complexity memoization Optimization parallel computing Probabilistic logic sequence analysis stopping time Testing Time complexity Visualization Watermarking
ISSN:	2169-3536, 2169-3536
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Be the first to leave a comment!