Abstract
We study Schneider’s p-adic continued fraction algorithms. For p=2, we give a combinatorial characterization of rational numbers that have terminating expansions. For arbitrary p, we give data showing that rationals with terminating expansions are relatively rare. Finally, we prove an analogue of Khinchin’s theorem.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Bundschuh, P.: p-adische Kettenbrüche und Irrationalität p-adischer Zahlen. Elem. Math. 32(2), 36–40 (1977)
Halmos, P.: Measure Theory. van Nostrand Reinhold, New York (1950)
Ruban, A.A.: Some metric properties of p-adic numbers. Sib. Math. J. 11, 176–180 (1970)
Ryll-Nardzewski, C.: On the ergodic theorems (II): Ergodic theory of continued fractions. Stud. Math. 12, 74–79 (1951)
Schneider, Th.: Über p-adische Kettenbrüche. In: Symposia Mathematica, Vol. IV, INDAM, Rome, 1968/69, pp. 181–189. Academic Press, London (1970)
van der Poorten, A.: Schneider’s continued fraction. In: Number Theory with an Emphasis on the Markoff Spectrum, Provo, UT, 1991. Lecture Notes in Pure and Appl. Math., vol. 147, pp. 271–281. Dekker, New York (1993)
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Hirsh, J., Washington, L.C. P-adic continued fractions. Ramanujan J 25, 389–403 (2011). https://doi.org/10.1007/s11139-010-9266-x
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s11139-010-9266-x