The average length of reduced regular continued fractions
From MaRDI portal
Recommendations
- Asymptotic behaviour of the first moment of the number of steps in the by-excess and by-deficiency Euclidean algorithms
- The mean number of steps in the Euclidean algorithm with odd partial quotients
- Asymptotic behaviour of the first and second moments for the number of steps in the Euclidean algorithm
- The average length of Minkowski's continued fractions
- The average length of finite continued fractions with fixed denominator
Cited in
(11)- The mean number of steps in the Euclidean algorithm with least absolute value remainders
- On semi-regular finite continued fractions
- On the statistics of partial quotients of finite continued fractions
- An asymptotic formula for the expectation of finite elliptic Minkowski fractions
- Asymptotic behaviour of the first moment of the number of steps in the by-excess and by-deficiency Euclidean algorithms
- The average length of Minkowski's continued fractions
- The average length of finite continued fractions with fixed denominator
- Asymptotic behaviour of the first and second moments for the number of steps in the Euclidean algorithm
- Bias in the number of steps in the Euclidean algorithm and a conjecture of Ito on Dedekind sums
- The mean number of steps in the Euclidean algorithm with odd partial quotients
- Mean value of sums of partial quotients of continued fractions
This page was built for publication: The average length of reduced regular continued fractions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3646319)
