Simultaneous Convergent Continued Fraction Algorithm for Real and p-adic Fields with Applications to Quadratic Fields

Abstract

Let p be a prime number and K be a field with embeddings into R and Qp. We propose an algorithm that generates continued fraction expansions converging in Qp and is expected to simultaneously converge in both R and Qp. This algorithm produces finite continued fraction expansions for rational numbers. In the case of p=2 and if K is a quadratic field, the continued fraction expansions generated by this algorithm converge in R, and they are eventually periodic or finite. For an element α in K, let pn/qn denote the n-th convergent. There exist constants u1 and u2 in R>0 with u1 + u2 = 2, and constants C1 and C2 in R>0 such that |α - pn/qn| < C1/|qn|u1 and |α - pn/qn|2 < C2/|qn|u2. Here, |·|2 represents the 2-adic distance. For prime numbers p > 2, we present numerical experiences.

0

Turn this paper into a lesson

ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…