Related papers: A simple algorithm for expanding a power series as…
Euler gave recipes for converting alternating series of two types, I and II, into equivalent continued fractions, i.e., ones whose convergents equal the partial sums. A condition we prove for irrationality of a continued fraction then…
While Roth's theorem states that the irrationality measure of all the irrational algebraic numbers is 2, and the same holds true over function fields in characteristic zero, some counter-examples were found over function fields in positive…
This work introduces a new functional series for expanding an analytic function in terms of an arbitrary analytic function. It is generally applicable and straightforward to use. It is also suitable for approximating the behavior of a…
In this paper, we represent a continued fraction expression of Mathieu series by a continued fraction formula of Ramanujan. As application, we obtain some new bounds for Mathieu series.
Euler gives a continued fraction representation of (1 + x)n. involving 1,3,5,7,... and n^2-1,n^2-4,n^3-9,... and squares of z, for x=2y and y=z/(1-z). He evaluates this continued fraction at z=t sqrt(-1), for "vanishing" n, and for infinite…
We prove a short general theorem which immediately implies some classical results of Hasse, Guillera and Sondow, Paolo Amore, and also Alzer and Richards. At the end we obtain a new representation for the Euler constant gamma. The theorem…
We compare two families of continued fractions algorithms, the symmetrized Rosen algorithm and the Veech algorithm. Each of these algorithms expands real numbers in terms of certain algebraic integers. We give explicit models of the natural…
The problem of extrapolating the series in powers of small variables to the region of large variables is addressed. Such a problem is typical of quantum theory and statistical physics. A method of extrapolation is developed based on…
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…
Many classical identities arise from nothing more mysterious than looking at the same object in two different ways. A number, a function, or a combinatorial object may admit several natural decompositions, and by disassembling it in one way…
We construct continued fraction expansions for several families of the Laurent series in $\mathbb{Q}[[t^{-1}]]$. To the best of the author's knowledge, this is the first result of this kind since Gauss derived the continued fraction…
We find, in the form of a continued fraction, the generating function for the number of (132)-avoiding permutations that have a given number of (123) patterns, and show how to extend this to permutations that have exactly one (132) pattern.…
We present an algebraic algorithm that computes the composition of two power series in softly linear time complexity. The previous best algorithms are $\mathop{\mathrm O}(n^{1+o(1)})$ by Kedlaya and Umans (FOCS 2008) and an $\mathop{\mathrm…
Generating functions related to Catalan words and frequencies of digits are obtained using continued fractions. This is fast, elegant, and flexible. It follows the philosophy of Philippe Flajolet from 1980.
Continued fraction expansions and Hankel determinants of automatic sequences are extensively studied during the last two decades. These studies found applications in number theory in evaluating irrationality exponents. The present paper is…
In this work, the authors provide closed forms and recurrence expressions for computing the $k$th power of the formal power series, some of them in terms of a determinant of some matrices. As a consequence, we obtain the reciprocal of the…
J. Hurwitz introduced an algorithm that generates a continued fraction expansion for complex numbers $\alpha \in \mathbb{C}$, where the partial quotients belong to $(1+i)\mathbb{Z}[i]$. J. Hurwitz's work also provides a result analogous to…
Translated from the Latin original, "Observationes generales circa series, quarum termini secundum sinus vel cosinus angulorum multiplorum progrediuntur" (1777). E655 in the Enestrom index. Euler looks at the binomial expansion $(1+x)^n$…
Consider the representation of a rational number as a continued fraction, associated with "odd" Euclidean algorithm. In this paper we prove certain properties for the limit distribution function for sequences of rationals with bounded sum…
We extend several celebrated methods in classical analysis for summing series of complex numbers to series of complex matrices. These include the summation methods of Abel, Borel, Ces\'aro, Euler, Lambert, N\"orlund, and Mittag-Leffler,…