arXiv · 1508.01503
A Division Algorithm Approach to $p$-Adic Sylvester Expansions
Abstract
A method of constructing finite $p$-adic Sylvester expansions for all rationals is presented. This method parallels the classical Fibonacci-Sylvester (greedy) algorithm by iterating a $p$-adic division algorithm. The method extends to irrational $p$-adics that have an embedding in the reals.
Explore related subjects
Keep this discovery
Eric Errthum. 2015-08-06. A Division Algorithm Approach to $p$-Adic Sylvester Expansions. https://arxiv.org/abs/1508.01503
Cite the original work for its findings. Save a collection to share your selection of sources.