  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.
