Related papers: A simple algorithm for expanding a power series as…
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.
In this paper, we introduce the polynomial continued fraction, a close relative of the well-known simple continued fraction expansions which are widely used in number theory and in general. While they may not possess all the intriguing…
In this paper, an explanation of the Newton-Peiseux algorithm is given. This explanation is supplemented with well-worked and explained examples of how to use the algorithm to find fractional power series expansions for all branches of a…
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 stated conjectures for Euler number $e$ and…
This is a translation of Euler's Latin paper "De fractionibus continuis observationes" into English. In this paper Euler describes his theory of continued fractions. He teaches, how to transform series into continued fractions, solves the…
Recently, A. I. Aptekarev and his collaborators found a sequence of rational approximations to Euler's constant $\gamma$ defined by a third-order homogeneous linear recurrence. In this paper, we give a new interpretation of Aptekarev's…
Hurwitz (1887) defined a continued fraction algorithm for complex numbers which is better behaved in many respects than a more "natural" extension of the classical continued fraction algorithm to the complex plane would be. Although the…
We study a natural extension to complex numbers of the standard continued fractions. The basic algorithm is due to Lagrange and Gauss, though it seems to have gone mostly unnoticed as a way to create continued fractions. The new…
In 1976, Baum and Sweet gave the first example of a power series that is algebraic over the field $\mathbb F_2(T)$ and whose continued fraction expansion has partial quotients with bounded degree. This power series is the unique solution of…
Efficient algorithms are known for many operations on truncated power series (multiplication, powering, exponential, ...). Composition is a more complex task. We isolate a large class of power series for which composition can be performed…
We discuss and illustrate the behaviour of the continued fraction expansion of a formal power series under specialisation of parameters or their reduction modulo $p$ and sketch some applications of the reduction theorem here proved.
In this paper, we apply results on number systems based on continued fraction expansions to modular arithmetic. We provide two new algorithms in order to compute modular multiplication and modular division. The presented algorithms are…
In this paper we present a method to derive Eulerian continued fractions arising from a sequence of integrals. As examples, through a new derivation, we reproduce classical continued fraction expansions for the natural logarithm, the…
We consider series expansions in bases of classical orthogonal polynomials. When such a series solves a linear differential equation with polynomial coefficients, its coefficients satisfy a linear recurrence equation. We interpret this…
The partial fraction expansion of coth($\pi$z), due to Euler, is generalized to power series having for coefficients the Riemann zeta function evaluated at certain arithmetic sequences. A further generalization using arbitrary Dirichlet…
In this paper we give an additive representation of the factorial, which can be proven by a simple quick analytical argument. We also present some generalizations, which are linked, on the one hand to an arithmetical theorem proven by Euler…
As was initially shown by Brent, exponentials of truncated power series can be computed using a constant number of polynomial multiplications. This note gives a relatively simple algorithm with a low constant factor.
Adolf Hurwitz proposed in 1887 a continued fraction algorithm for complex numbers: Hurwitz continued fractions (HCF). Among other similarities between HCF and regular continued fractions, quadratic irrational numbers over $\mathbb{Q}(i)$…
By applying the MC algorithm and the Bauer-Muir transformation for continued fractions, in this paper we shall give six examples to show how to establish an infinite set of continued fraction formulas for certain Ramanujan-type series, such…
We propose a novel factorization algorithm that leverages the theory underlying the SQUFOF method, including reduced quadratic forms, infrastructural distance, and Gauss composition. We also present an analysis of our method, which has a…