Über die mittlere Schrittanzahl bei Divisionsalgorithmen

DOI10.1002/MANA.19780820115MaRDI QIDQ4163602zbMATH OpenOpenAlexFDO

Authors Georg Johann Rieger

Publication date 1978

Published in Mathematische Nachrichten (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1002/mana.19780820115

Mathematics Subject Classification ID

Radix representation; digital problems (11A63) Normal numbers, radix expansions, Pisot numbers, Salem numbers, good lattice points, etc. (11K16)

Cited in

(12)

• Ein Gauss-Kusmin-Levy-Satz für Kettenbrüche nach nächsten Ganzen
• A note on ``Euclidean algorithms are Gaussian by V. Baladi and B. Vallée
• Euclidean algorithms are Gaussian
• An upper bound on the average number of iterations of the LLL algorithm
• On the worst case of three algorithms for computing the Jacobi symbol
• Digits and continuants in Euclidean algorithms. Ergodic versus Tauberian theorems
• A Gauss-Kusmin theorem for optimal continued fractions
• Über die Schrittanzahl beim Algorithmus von Harris und dem nach nächsten Ganzen
• Dynamical analysis of a class of Euclidean algorithms.
• The mean number of steps in the Euclidean algorithm with odd partial quotients
• Midpoint criteria for solving Pell’s equation using the nearest square continued fraction
• Mean for the sum of elements over a class of finite continued fractions

This page was built for publication: Über die mittlere Schrittanzahl bei Divisionsalgorithmen

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