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
Publication date: 7 December 2015
Published in: Journal of Number Theory (Search for Journal in Brave)
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.
Full work available at URL: https://arxiv.org/abs/1508.01503
Recommendations
- Division and slope factorization of \(p\)-adic polynomials
- On \(\mathfrak{p}\)-adic expansions of algebraic integers
- scientific article; zbMATH DE number 971783
- scientific article; zbMATH DE number 4125509
- A characterization of rational numbers by p-adic Sylvester series expansions
- \(p\)-adic properties of division polynomials and elliptic divisibility sequences
- Multidimensional $p$-adic continued fraction algorithms
- Algebraic p-adic expansions
- scientific article; zbMATH DE number 3922795
- scientific article; zbMATH DE number 6693374
Cites Work
- Title not available (Why is that?)
- The representation of real numbers by infinite series of rationals
- Infinite series expansions for \(p\)-adic numbers
- Series expansions in \(p\)-adic and other non-archimedean fields
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- A characterization of rational numbers by p-adic Sylvester series expansions
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)