Small quotients in Euclidean algorithms

From MaRDI portal





The authors present an estimation of the probability that a rational number with a denominator at most \(N\) has all the digits in the continued fraction expansion less than \(M\).











This page was built for publication: Small quotients in Euclidean algorithms

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q631506)