Article ID Journal Published Year Pages File Type
4593394 Journal of Number Theory 2016 10 Pages PDF
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.

Keywords
Related Topics
Physical Sciences and Engineering Mathematics Algebra and Number Theory
Preview
A division algorithm approach to p-adic Sylvester expansions
Authors
,