On Shanks' algorithm for computing the continued fraction of $\log_b a$
J. Integer Seq. 5(2), Art. 02.2.7, 9 p., electronic only (2002)
Summary
Summary: We give a more practical variant of Shanks' 1954 algorithm for computing the continued fraction of log_b $a$, for integers $a > b > 1$, using the floor and ceiling functions and an integer parameter $c > 1$. The variant, when repeated for a few values of $c = 10$^r, enables one to guess if log_b $a$ is rational and to find approximately $r$ partial quotients.
Mathematics Subject Classification
11D09
Keywords/Phrases
shanks' algorithm, continued fraction, log, heuristic algorithm (Concerned with sequence
