Search Results for ""
91 - 100 of 1208 for Generalized Continued FractionSearch Results
For a real number x in (0,1), let m be the number of terms in the convergent to a regular continued fraction that are required to represent n decimal places of x. Then for ...
The number p in a fraction p/q, i.e., the dividend.
An algorithm for computing an Egyptian fraction.
An algorithm for computing an Egyptian fraction.
In the course of searching for continued fraction identities, Raayoni (2021) and Elimelech et al. (2023) noticed that while the numerator and denominator of continued ...
A noble number nu is defined as an irrational number having a continued fraction that becomes an infinite sequence of 1s at some point, nu=[0,a_1,a_2,...,a_n,1^_]. The ...
A number with a continued fraction whose terms are the values of one or more polynomials evaluated on consecutive integers and then interleaved. This property is preserved by ...
The transformation T(x) = frac(1/x) (1) = 1/x-|_1/x_|, (2) where frac(x) is the fractional part of x and |_x_| is the floor function, that takes a continued fraction ...
A Trott constant is a real number whose decimal digits are equal to the terms of its continued fraction. The first Trott constant (OEIS A039662) was discovered by M. Trott in ...
An algorithm for computing an Egyptian fraction (Stewart 1992).
...
View search results from all Wolfram sites (143858 matches)

