Logo
ScienceStack
Table of Contents
Fetching ...
Sign In

Convergence, Finiteness and Periodicity of Several New Algorithms of p-adic Continued Fractions

Zhaonan Wang, Yingpu Deng

Abstract

$p$-adic continued fractions, as an extension of the classical concept of classical continued fractions to the realm of $p$-adic numbers, offering a novel perspective 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 Theorem for classic continued fractions, which indicates that every quadratic irrationals can be expanded periodically, remains elusive. In this paper, we present several new algorithms that can be viewed as refinements of the existing $p$-adic continued fraction algorithms. We give an upper bound of the length of partial quotients when expanding rational numbers, and prove that for small primes $p$, our algorithm can generate periodic continued fraction expansions for all quadratic irrationals. As confirmed through experimentation, one of our algorithms can be viewed as the best $p$-adic algorithm available to date. Furthermore, we provide an approach to establish a $p$-adic continued fraction expansion algorithm that could generate periodic expansions for all quadratic irrationals in $\mathbb{Q}_p$ for a given prime $p$.

Convergence, Finiteness and Periodicity of Several New Algorithms of p-adic Continued Fractions

Abstract

-adic continued fractions, as an extension of the classical concept of classical continued fractions to the realm of -adic numbers, offering a novel perspective on number representation and approximation. While numerous -adic continued fraction expansion algorithms have been proposed by the researchers, the establishment of several excellent properties, such as the Lagrange Theorem for classic continued fractions, which indicates that every quadratic irrationals can be expanded periodically, remains elusive. In this paper, we present several new algorithms that can be viewed as refinements of the existing -adic continued fraction algorithms. We give an upper bound of the length of partial quotients when expanding rational numbers, and prove that for small primes , our algorithm can generate periodic continued fraction expansions for all quadratic irrationals. As confirmed through experimentation, one of our algorithms can be viewed as the best -adic algorithm available to date. Furthermore, we provide an approach to establish a -adic continued fraction expansion algorithm that could generate periodic expansions for all quadratic irrationals in for a given prime .
Paper Structure (8 sections, 14 theorems, 86 equations, 1 table)

This paper contains 8 sections, 14 theorems, 86 equations, 1 table.

Table of Contents

  1. Introduction
  2. Preliminaries
  3. The New Algorithm
  4. Convergence
  5. Finiteness
  6. Periodicity
  7. Computational Results
  8. Conclusions

Key Result

Proposition 1

Let $|\cdot|$ be the Euclidean norm, then we have: (1) For all $a,b\in J_p$ and $a\neq b$, $v_p(a-b)\leq0$; (2) For all $a,b\in K_p$ and $a\neq b$, $v_p(a-b)<0$; (3) Let $\alpha\in\mathbb{Q}_p$, then $|s(\alpha)|<\frac{p}{2}$ and $|t(\alpha)|<\frac{1}{2}$.

Theorems & Definitions (32)

  • Proposition 1
  • Lemma 1
  • Lemma 2
  • Lemma 3
  • proof
  • Lemma 4
  • Remark 1
  • Lemma 5
  • proof
  • Remark 2
  • ...and 22 more