On the periodicity of an algorithm for p-adic continued fractions

From MaRDI portal
Publication:6046855

DOI10.1007/S10231-023-01347-6arXiv2201.12019OpenAlexW4379053577MaRDI QIDQ6046855FDOQ6046855


Authors: Nadir Murru, Giuliano Romeo, Giordano Santilli Edit this on Wikidata


Publication date: 6 October 2023

Published in: Annali di Matematica Pura ed Applicata. Serie Quarta (Search for Journal in Brave)

Abstract: In this paper we study the properties of an algorithm for generating continued fractions in the field of p-adic numbers mathbbQp. First of all, we obtain an analogue of the Galois' Theorem for classical continued fractions. Then, we investigate the length of the preperiod for periodic expansions of square roots. Finally, we prove that there exist infinitely many square roots of integers in mathbbQp that have a periodic expansion with period of length four, solving an open problem left by Browkin.


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




Recommendations




Cites Work


Cited In (7)





This page was built for publication: On the periodicity of an algorithm for \(p\)-adic continued fractions

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