A Division Algorithm Approach to $p$-Adic Sylvester Expansions
Number Theory
2015-08-07 v1
Abstract
A method of constructing finite -adic Sylvester expansions for all rationals is presented. This method parallels the classical Fibonacci-Sylvester (greedy) algorithm by iterating a -adic division algorithm. The method extends to irrational -adics that have an embedding in the reals.
Cite
@article{arxiv.1508.01503,
title = {A Division Algorithm Approach to $p$-Adic Sylvester Expansions},
author = {Eric Errthum},
journal= {arXiv preprint arXiv:1508.01503},
year = {2015}
}