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...

Ausführliche Beschreibung

Gespeichert in:

Bibliographische Detailangaben
Veröffentlicht in:	IEEE access Jg. 13; S. 41210 - 41220
Hauptverfasser:	Getachew, Eyob Solomon, Assefa, Beakal Gizachew
Format:	Journal Article
Sprache:	Englisch
Veröffentlicht:	IEEE 2025
Schlagworte:	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-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!

Schreiben Sie den ersten Kommentar!