Continued fractions constructed from prime numbers
Marek Wolf
备注:
Considerably extended version of previous submission. We add the discussion of transcendentality of continued fractions constructed from prime numbers. 35 pages and 9 Figures
We give 50 digits values of the simple continued fractions whose denominators are formed from a) prime numbers, b) twin primes, c) generalized $d$-twins, d) primes of the form $m^2+n^4$, e)primes of the form $m^2+1$, f) Mersenne primes and g) primorial primes. All these continued fractions belong to the set of measure zero of exceptions to the theorems of Khinchin and Levy. We claim that all these continued fractions are transcendental numbers. Next we propose the conjecture which indicates the way to deduce the transcendence of some continued fractions from transcendence of another ones.
In this note, we study the problem of existence of sequences of consecutive 1's in the periodic part of the continued fractions expansions of square roots of primes. We prove unconditionally that, for a given $N\gg 1$, there are at least $N\log^{-3/2}N$ prime numbers $p\leq N$ such that the continued fraction expansion of $\sqrt{p}$ contains three consecutive 1's on the beginning of the periodic part. We also present results of our computations related to the considered problem and some related problems, formulate several open questions and conjectures and get some results under the assumption…
We provide several asymptotic expansions of the prime counting function $π(x)$ and related functions. We define an {\it asymptotic continued fraction expansion} of a complex-valued function of a real or complex variable to be a possibly divergent continued fraction whose approximants provide an asymptotic expansion of the given function. We show that, for each positive integer $n$, two well-known continued fraction expansions of the exponential integral function $E_n(z)$ correspondingly yield two asymptotic continued fraction expansions of $π(x)/x$. We prove this by first establishing some gen…
The algorithm of Shor for prime factorization is a hybrid algorithm consisting of a quantum part and a classical part. The main focus of the classical part is a continued fraction analysis. The presentation of this is often short, pointing to text books on number theory. In this contribution, we present the relevant results and proofs from the theory of continued fractions in detail (even in more detail than in text books) filling the gap to allow a complete comprehension of the algorithm of Shor. Similarly, we provide a detailed computation of the estimation of the probability that convergent…
For a monic polynomial $D(X)$ of even degree, express $\sqrt D$ as a Laurent series in $X^{-1}$; this yields a continued fraction expansion (similar to continued fractions of real numbers): \[\sqrt D=a_0+\dfrac{1}{a_1+\dfrac{1}{a_2+\dfrac{1}{\ddots}}},\quad a_i\text{ polynomials in }X.\] Such continued fractions were first considered by Abel in 1826, and later by Chebyshev. It turns out they are rarely periodic unless $D$ is defined over a finite field. Around 2001 van der Poorten studied non-periodic continued fractions of $\sqrt D$, with $D$ defined over the rationals, and simultaneously the…
We prove several asymptotic continued fraction expansions of $π(x)$, $Π(x)$, $\operatorname{li}(x)$, $\operatorname{Ri}(x)$, and related functions, where $π(x)$ is the prime counting function, $Π(x) = \sum_{k = 1}^\infty \frac{1}{k}π(\sqrt[k]{x})$ is the Riemann prime counting function, and $\operatorname{Ri}(x) = \sum_{k=1}^\infty \frac{ μ(k)}{k} \operatorname{li}(\sqrt[k]{x})$ is Riemann's approximation to the prime counting function. We also determine asymptotic continued fraction expansions of the function $\sum_{p \leq x} p^s$ for all $s \in \mathbb{C}$ with $\operatorname{Re}(s) > -1$, a…
Let $H(m,d)$ denote the asymptotic frequency of the natural numbers $k\equiv d \mod m$ in the continued fraction expansions of almost all numbers $x\in[0,1)$. For a fixed number $m\ge 4$, we study $\mathbb Q$-linear relations among the numbers $H(m,d)$, $1\le d\le m-3$, i.e., vectors $(c_1,\ldots,c_{m-3})\in\mathbb Q^{m-3}$ such that $$ \sum_{d=1}^{m-3} c_dH(m,d)=0. $$ We restrict ourselves to the symmetric case $c_d=c_{m-2-d}$. In the end, we obtain a basis of the $\mathbb Q$-vector space of these relations for prime powers $m$ and for $m=pq$, where $p\ne q$ are primes.
Given an odd prime number p, we describe a continued fraction in the field F(p) of power series in 1/T with coefficients in the finite field F_p, where T is a formal indeterminate. This continued fraction satisfies an algebraic equation of a particular type, with coefficients in F_p[T] which are explicitely given. We observe the close connection with other algebraic continued fractions studied thirty years ago by Mills and Robbins.
We discuss the form of certain algebraic continued fractions in the field of power series over $F_p$, where p is an odd prime number. This leads to give explicit continued fractions in these fields, satisfying an explicit algebraic equation of arbitrary degree $d\geq 2$ and having an irrationality measure equal to $d$. Our results are based on a mysterious finite sequence of rational numbers.
We develop a theory of $p$-adic continued fractions for a quaternion algebra $B$ over $\mathbb Q$ ramified at a rational prime $p$. Many properties holding in the commutative case can be proven also in this setting. In particular, we focus our attention on the characterization of elements having a finite continued fraction expansion. By means of a suitable notion of quaternionic height, we prove a criterion for finiteness. Furthermore, we draw some consequences about the solutions of a family of quadratic polynomial equations with coefficients in $B$.
We present family of automatic sequences that define algebraic continued fractions in characteristic 2. This family is constructed from ultimately period words and contains the period-doubling sequence.
Let x be a quadratic irrational and let P be the set of prime numbers. We show the existence of an infinite subset S of P such that the statistics of the period of the continued fraction expansions along the sequence {px: p\in S} approach the normal statistics given by the Gauss-Kuzmin measure. Under the generalized Riemann hypothesis, we prove that there exist full density subsets S of P and T of N satisfying the same assertion. We give a rate of convergence in all cases.
In this article, for a certain subset $\mathcal{X}$ of the extended set of rational numbers, we introduce the notion of {\it best $\mathcal{X}$-approximations} of a real number. The notion of best $\mathcal{X}$-approximation is analogous to that of best rational approximation. We explore these approximations with the help of $\mathcal{F}_{p^l}$-continued fractions, where $p$ is a prime and $l\in\mathbb{N}$, we show that the convergents of the $\mathcal{F}_{p^l}$-continued fraction expansion of a real number $x$ satisfying certain maximal conditions are exactly the best $\mathcal{F}_{p^l}$-appr…
In this note, we study a family of subgraphs of the Farey graph, denoted as $\mathcal{F}_N$ for every $N\in\mathbb{N}.$ We show that $\mathcal{F}_N$ is connected if and only if $N$ is either equal to one or a prime power. We introduce a class of continued fractions referred to as $\mathcal{F}_N$-continued fractions for each $N>1.$ We establish a relation between $\mathcal{F}_N$-continued fractions and certain paths from infinity in the graph $\mathcal{F}_N.$ We discuss existence and uniqueness of $\mathcal{F}_N$-continued fraction expansions of real numbers.
Let ${\bf F}_q$ be a finite field of order a positive power $q$ of a prime number. We study the nonarchimedean quadratic Lagrange spectrum defined by Parkkonen and Paulin by considering the approximation by elements of the orbit of a given quadratic power series in ${\bf F}_q((Y^{-1}))$, for the action by homographies and anti-homographies of ${\rm PGL}_2({\bf F}_q[Y])$ on ${\bf F}_q((Y^{-1})) \cup \{\infty\}$. While their approach used geometric methods of group actions on Bruhat--Tits trees, ours is based on the theory of continued fractions in power series fields.
On $\mathfrak{P}$-adic continued fractions with extraneous denominators: some explicit finiteness results
Dipartimento di Matematica e Fisica, Università degli Studi di Roma Tre(罗马第三大学数学与物理系);Univ. Grenoble Alpes, CNRS, IF(格勒诺布尔阿尔卑斯大学);Research Institute CODE, Universität der Bundeswehr München(慕尼黑联邦国防军大学CODE研究所);Dipartimento di Informatica, Università di Torino(都灵大学计算机科学系)
A continued fraction $v(τ)$ of Ramanujan is evaluated at certain arguments in the field $K = \mathbb{Q}(\sqrt{-d})$, with $-d \equiv 1$ (mod $8$), in which the ideal $(2) = \wp_2 \wp_2'$ is a product of two prime ideals. These values of $v(τ)$ are shown to generate the inertia field of $\wp_2$ or $\wp_2'$ in an extended ring class field over the field $K$. The conjugates over $\mathbb{Q}$ of these same values, together with $0, -1 \pm \sqrt{2}$, are shown to form the exact set of periodic points of a fixed algebraic function $\hat F(x)$, independent of $d$. These are analogues of similar resul…
Unlike the real case, there are not many studies and general techniques for providing simultaneous approximations in the field of $p$--adic numbers $\mathbb Q_p$. Here, we study the use of multidimensional continued fractions (MCFs) in this context. MCFs were introduced in $\mathbb R$ by Jacobi and Perron as a generalization of continued fractions and they have been recently defined also in $\mathbb Q_p$. We focus on the dimension two and study the quality of the simultaneous approximation to two $p$-adic numbers provided by $p$-adic MCFs, where $p$ is an odd prime. Moreover, given algebraical…
In recent work, the first two authors constructed a generalized continued fraction called the $p$-continued fraction, characterized by the property that its convergents (a subsequence of the regular convergents) are best approximations with respect to the $L^p$ norm, where $p\geq 1$. We extend this construction to the region $0<p<1$, where now the $L^p$ quasinorm is non-convex. We prove that the approximation coefficients of the $p$-continued fraction are bounded above by $1/\sqrt{5}+\varepsilon_p$, where $\varepsilon_p\to 0$ as $p\to 0$. In light of Hurwitz's theorem, this upper bound is shar…
The problem of representing a given positive integer as a sum of four squares of integers has been widely concerned for a long time, and for a given positive odd $n$ one can find a representation by doing arithmetic in a maximal order of quaternion algebra once a pair of (positive) integers $x,y$ with $x^2+y^2\equiv-1\mod n$ is given. In this paper, we introduce a new method to find a representation of odd integer $w$ given $x,y$ satisfying the above requirement. This method can avoid the complicated non-commutative structure in quaternion algebra, which is similar to the one we use to obtain …
Representations of the Cuntz algebra $\mathcal{O}_N$ are constructed from interval dynamical systems associated with slow continued fraction algorithms introduced by Giovanni Panti. Their irreducible decomposition formulas are characterized by using the modular group action on real numbers, as a generalization of results by Kawamura, Hayashi and Lascu. Furthermore, a certain symmetry of such an interval dynamical system is interpreted as a covariant representation of the $C^*$--dynamical system ofthe `flip-flop' automorphism of $\mathcal{O}_2$.
We examine the polynomial analogues of McMullen's and Zaremba's conjectures on continued fractions with bounded partial quotients. It has already been proved by Blackburn that if the base field is infinite, then the polynomial analogue of Zaremba's conjecture holds; we will prove this again with a different method and examine some known results for finite base fields. Translating to the polynomial setting a result of Mercat, we will prove that the polynomial analogue of McMullen's conjecture holds over infinite algebraic extensions of finite fields and that, over finite fields, it would be a c…
In this paper we study the dimension spectrum of continued fractions with coefficients restricted to infinite subsets of natural numbers. We prove that if $E$ is any arithmetic progression, the set of primes, or the set of squares $\{n^2\}_{n \in \mathbb{N}}$, then the continued fractions whose digits lie in $E$ have full dimension spectrum, which we denote by $DS(\mathcal{CF}_E)$. Moreover we prove that if $E$ is an infinite set of consecutive powers then the dimension spectrum $DS(\mathcal{CF}_E)$ always contains a non trivial interval. We also show that there exists some $E \subset \mathbb{…
In this paper, we prove that almost every translation of $\mathbb{T}^2$ admits a symbolic coding which has linear complexity $2n+1$. The partitions are constructed with Rauzy fractals associated with sequences of substitutions, which are produced by a particular extended continued fraction algorithm in projective dimension $2$. More generally, in dimension $d\geq 1$, we study extended measured continued fraction algorithms, which associate to each direction a subshift generated by substitutions, called $S$-adic subshift. We give some conditions which imply the existence, for almost every direc…
In recent years, computer simulations are playing a fundamental role in unveiling some of the most intriguing features of prime numbers. In this work, we define an algorithm for a deterministic walk through a two-dimensional grid that we refer to as Prime Walk. The walk is constructed from a sequence of steps dictated by and dependent on the sequence of last digits of the primes. Despite the apparent randomness of this generating sequence, the resulting structure -- both in 2d and 3d -- created by the algorithm presents remarkable properties and regularities in its pattern that we proceed to a…
Several examples of generalized number systems are constructed to compare various conditions occurring in the literature for the prime number theorem in the context of Beurling generalized primes.
The notion of chiral prime concatenations is studied as a recursive construction of prime numbers starting from a seed set and with appropriate blocks to define the primality growth, generation by generation, either from the right or from the left. Several basic questions are addressed like whether chiral concatenation is a symmetric process, an endless process, as well as the calculation of largest chiral prime numbers. In particular, the largest left-concatenated prime number is constructed. It is a unique prime number of 24 digits. By introducing anomalous left-concatenations of primes we c…