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 for prime factorization.
In this short note we show that the octagon Farey map introduced by Smillie
and Ulcigrai is an acceleration of the diagonal changes algorithm introduced by
Delecroix and Ulcigrai.
We investigate branched-continued-fraction representations of ratios of contiguous hypergeometric series and type ii multiple orthogonal polynomials on the step-line with respect to linear functionals or measures whose moments are ratios of products of products of pochhammer symbols.
We construct new branched continued fractions for ratios of contiguous hypergeometric series and we give conditions for positivity of the coefficients of these branched continued fractions and we show that the ratios of products of products of products of pochhammer symbols are generating polynomials of lattice paths for a special case of the same branched continued fractions.
Jordan Normal Forms serve as excellent representatives of conjugacy classes
of matrices over closed fields. Once we knows normal forms, we can compute
functions of matrices, their main invariant, etc.
For $\alpha_0 = \left[a_0, a_1, \ldots\right]$ an infinite continued fraction
and $\sigma$ a linear fractional transformation, we study the continued
fraction expansion of $\sigma(\alpha_0)$ and its c
Legendre found that the continued fraction expansion of $\sqrt N$ having odd
period leads directly to an explicit representation of $N$ as the sum of two
squares. Similarly, it is shown here that the
We continue the study of random continued fraction expansions, generated by
random application of the Gauss and the R\'enyi backward continued fraction
maps. We show that this random dynamical system
Repeatedly folding a strip of paper in half and unfolding it in straight
angles produces a fractal: the dragon curve. Shallit, van der Poorten and
others showed that the sequence of right and left tur
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
We give a new continued fraction expansion algorithm for certain real numbers
related to Weber's class number problem. By considering the analogy of the
solution of Pell's equations, we get an explici
We show that the additive-slow-Farey version of the traditional continued
fractions algorithm has a natural interpretation as a method for producing
integer partitions of a positive number $n$ into tw
Recently Raayoni et al. announced various conjectures on continued fractions
of fundamental constants automatically generated with machine learning
techniques. In this paper we prove some of their sta
We show that normality for continued fractions expansions and normality for
base-$b$ expansions are maximally logically separate. In particular, the set of
numbers that are normal with respect to the
This paper introduces high school students to continued fractions and
develops basic properties of Finite Continued Fractions and Infinite Continued
Fractions. This also includes computation of the qu
By using Euler's approach of using Euclid's algorithm to expand a power
series into a continued fraction, we show how to derive Ramanujan's
$q$-continued fractions in a systematic manner.
Let $R(q)$ be the Rogers-Ramanujan continued fraction. We give different
proofs of two complementary relations for $R(q)$ given by Ramanujan and proved
by Watson and Ramanathan. Our proofs only use pr
In this short note we prove two elegant generalized continued fraction
formulae $$e= 2+\cfrac{1}{1+\cfrac{1}{2+\cfrac{2}{3+\cfrac{3}{4+\ddots}}}}$$
and $$e= 3+\cfrac{-1}{4+\cfrac{-2}{5+\cfrac{-3}{6+\c
We describe geometric algorithms that generalize the classical continuedfraction algorithm for the torus to all translation surfaces in hyperelliptic components of translation surfaces.
We show that these algorithms produce all saddle connections which are best approximations in a geometric sense, which generalizes the notion of best approximation for the classical continuedfraction.
We prove a central limit theorem for Birkho? sums of the Rosen continued
fraction algorithm. A Lasota-Yorke bound is obtained for general
one-dimensional continued fractions with the bounded variation
We describe various kaleidoscopic and self-similar aspects of the integralapollonian gaskets-fractals consisting of close packing of circles with integer curvatures.
Self-similar recursive structure of the whole gasket is shown to be encoded in transformations that forms the modular group.