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

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
Main Authors: Eyob Solomon Getachew, Beakal Gizachew Assefa
Format: Article
Language:English
Published: IEEE 2025-01-01
Series:IEEE Access
Subjects:
Algorithm optimization
bitwise operations
Collatz conjecture
Collatz tree
computational mathematics
high-performance algorithms
Online Access:https://ieeexplore.ieee.org/document/10910185/
Tags: Add Tag
No Tags, Be the first to tag this record!

Internet

https://ieeexplore.ieee.org/document/10910185/

Similar Items