A division algorithm approach to p-adic Sylvester expansions

From MaRDI portal
Publication:897524

DOI10.1016/J.JNT.2015.08.016zbMATH Open1396.11012arXiv1508.01503OpenAlexW2964164998MaRDI QIDQ897524FDOQ897524


Authors: Eric Errthum Edit this on Wikidata


Publication date: 7 December 2015

Published in: Journal of Number Theory (Search for Journal in Brave)

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.


Full work available at URL: https://arxiv.org/abs/1508.01503




Recommendations




Cites Work


Cited In (5)





This page was built for publication: A division algorithm approach to \(p\)-adic Sylvester expansions

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q897524)