Skip to Main Content

Mathematics of Computation

Published by the American Mathematical Society since 1960 (published as Mathematical Tables and other Aids to Computation 1943-1959), Mathematics of Computation is devoted to research articles of the highest quality in computational mathematics.

ISSN 1088-6842 (online) ISSN 0025-5718 (print)

The 2020 MCQ for Mathematics of Computation is 1.78.

What is MCQ? The Mathematical Citation Quotient (MCQ) measures journal impact by looking at citations over a five-year period. Subscribers to MathSciNet may click through for more detailed information.

 

Convergence, finiteness and periodicity of several new algorithms of $p$-adic continued fractions
HTML articles powered by AMS MathViewer

by Zhaonan Wang and Yingpu Deng
Math. Comp.
DOI: https://doi.org/10.1090/mcom/3948
Published electronically: February 5, 2024

Abstract:

Classical continued fractions can be introduced in the field of $p$-adic numbers, where $p$-adic continued fractions offer novel perspectives on number representation and approximation. While numerous $p$-adic continued fraction expansion algorithms have been proposed by the researchers, the establishment of several excellent properties, such as the Lagrange’s Theorem for classic continued fractions, which indicates that every quadratic irrationals can be expanded periodically, remains elusive. In this paper, we introduce several new algorithms designed for expanding algebraic numbers in $\mathbb {Q}_p$ for a given prime $p$. We give an upper bound of the number of partial quotients for the expansion of rational numbers, and prove that for small primes $p$, our algorithm generates periodic continued fraction expansions for all quadratic irrationals. Experimental data demonstrates that our algorithms exhibit better performance in the periodicity of expansions for quadratic irrationals compared to the existing algorithms. Furthermore, for bigger primes $p$, we propose a potential approach to establish a $p$-adic continued fraction expansion algorithm. As before, the algorithm is designed to expand algebraic numbers in $\mathbb {Q}_p$, while generating periodic expansions for all quadratic irrationals in $\mathbb {Q}_p$.
References
Similar Articles
  • Retrieve articles in Mathematics of Computation with MSC (2020): 11J70, 11Y65, 11D88
  • Retrieve articles in all journals with MSC (2020): 11J70, 11Y65, 11D88
Bibliographic Information
  • Zhaonan Wang
  • Affiliation: Key Laboratory of Mathematics Mechanization, NCMIS, Academy of Mathematics and Systems Science, Chinese Academy of Sciences, Beijing 100190, People’s Republic of China; and School of Mathematical Sciences, University of Chinese Academy of Sciences, Beijing 100049, People’s Republic of China
  • Email: znwang@amss.ac.cn
  • Yingpu Deng
  • Affiliation: Key Laboratory of Mathematics Mechanization, NCMIS, Academy of Mathematics and Systems Science, Chinese Academy of Sciences, Beijing 100190, People’s Republic of China; and School of Mathematical Sciences, University of Chinese Academy of Sciences, Beijing 100049, People’s Republic of China
  • Email: dengyp@amss.ac.cn
  • Received by editor(s): September 8, 2023
  • Received by editor(s) in revised form: November 28, 2023
  • Published electronically: February 5, 2024
  • Additional Notes: This work was supported by National Key Research and Development Program of China (No. 2020YFA0712300) and National Natural Science Foundation of China (No. 12271517).
  • © Copyright 2024 American Mathematical Society
  • Journal: Math. Comp.
  • MSC (2020): Primary 11J70, 11Y65, 11D88
  • DOI: https://doi.org/10.1090/mcom/3948