Ein H<scp>EILBRONN</scp>‐Satz für Kettenbrüche mit ungeraden Teilnennern
DOI10.1002/MANA.19811010126zbMATH Open0481.10032OpenAlexW2040315283MaRDI QIDQ3937484FDOQ3937484
Authors: Georg Johann Rieger
Publication date: 1981
Published in: Mathematische Nachrichten (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/mana.19811010126
average length of continued fractionbackward algorithmHeilbronn theoremcontinued fractions with odd partial quotients
Continued fractions and generalizations (11J70) Normal numbers, radix expansions, Pisot numbers, Salem numbers, good lattice points, etc. (11K16)
Cites Work
Cited In (6)
- A Gaussian Measure for Certain Continued Fractions
- Continued fractions with odd partial quotients
- Sur le développement en fractions continues à quotients partiels impairs. (On the development of continued fractions with odd partial quotients.)
- The mean number of steps in the Euclidean algorithm with odd partial quotients
- Automata and continued fractions
- Distribution of the reduced quadratic irrationals arising from the odd continued fraction expansion
This page was built for publication: Ein H<scp>EILBRONN</scp>‐Satz für Kettenbrüche mit ungeraden Teilnennern
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3937484)