arXiv · 1606.03881
Length of the continued logarithm algorithm on rational inputs
Abstract
The continued logarithm algorithm was introduced by Gosper around 1978, and recently studied by Borwein, Calkin, Lindstrom, and Mattingly. In this note I show that the continued logarithm algorithm terminates in at most 2 log_2 p + O(1) steps on input a rational number p/q >= 1. Furthermore, this bound is tight, up to an additive constant.
Explore related subjects
Keep this discovery
Jeffrey Shallit. 2016-06-21. Length of the continued logarithm algorithm on rational inputs. https://arxiv.org/abs/1606.03881
Cite the original work for its findings. Save a collection to share your selection of sources.