Related papers: The MC algorithm and its applications
Via the MC-algorithm, in this paper we produce seven continued fraction formulae involving products and quotients of three gamma functions with three parameters, and another is an extension of Entry 34 in Chapter 12 of Ramanujan's second…
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.
In this paper we show that various continued fractions for the quotient of general Ramanujan functions $G(aq,b,\l q)/G(a,b,\l)$ may be derived from each other via Bauer-Muir transformations. The separate convergence of numerators and…
The Ramanujan Machine project detects new expressions related to constants of interest, such as $\zeta$ function values, $\gamma$ and algebraic numbers (to name a few). In particular the project lists a number of conjectures concerning the…
Several continued fraction expansions for $e$ have been produced by an automated conjecture generator (ACG) called \emph{The Ramanujan Machine}. Some of these were already known, some have recently been proved and some remain unproven.…
In this paper we show how to apply various techniques and theorems (including Pincherle's theorem, an extension of Euler's formula equating infinite series and continued fractions, an extension of the corresponding transformation that…
We derive continued fractions for partition generating functions, utilizing both Euler's techniques and Ramanujan's techniques. Although our results are for integer partitions there is scope to extend this work to vector partitions,…
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.
We present here two classes of infinite series and the associated continued fractions involving $\pi$ and Catalan's constant $G$ based on the work of Euler and Ramanujan. A few sundry continued fractions are also given.
The Ramanujan Machine project predicts new continued fraction representations of numbers expressed by important mathematical constants. Generally, the value of a continued fraction is found by reducing it to a second order linear difference…
The goal of this paper is to formulate a systematical method for constructing the fastest possible continued fraction approximations of a class of functions. The main tools are the multiple-correction method, the generalized Mortici's lemma…
The goal of this work is to formulate a systematical method for looking for the simple closed form or continued fraction representation of a class of rational series. As applications, we obtain the continued fraction representations for the…
We use the method of generating functions to find the limit of a $q$-continued fraction, with 4 parameters, as a ratio of certain $q$-series. We then use this result to give new proofs of several known continued fraction identities,…
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 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…
The problem of developing an arithmetic for continued fractions (in order to perform, e.g., sums and products) does not have a straightforward solution and has been addressed by several authors. In 1972, Gosper provided an algorithm to…
In this paper we recall some results and some criteria on the convergence of matrix continued fractions. The aim of this paper is to give some properties and results of continued fractions with matrix arguments. Then we give continued…
In this paper, we establish the irrationality of some open problems in mathematics based on using a recursive formula that generate the complete sequence of numbers. see [1] But before getting into that we begin with some Ramanujan notable…
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.…
Inspired by the recent pioneering work, dubbed "The Ramanujan Machine" by Raayoni et al. (arXiv:1907.00205), we (automatically) [rigorously] prove some of their conjectures regarding the exact values of some specific infinite continued…