The number of steps in the Euclidean algorithm over complex quadratic fields

DOI10.1007/BF01931288MaRDI QIDQ807674zbMATH OpenFDO

Authors Arnold Knopfmacher, John Knopfmacher

Publication date 1991

Published in BIT (Search for Journal in Brave)

zbMATH Keywords

Euclidean algorithmimaginary-quadratic number fields

Mathematics Subject Classification ID

Algebraic numbers; rings of algebraic integers (11R04) Multiplicative structure; Euclidean algorithm; greatest common divisors (11A05) Quadratic extensions (11R11) Euclidean rings and generalizations (13F07)

Recommendations

• The number of steps in the Euclidean algorithm
• On the number of divisions of the Euclidean algorithm applied to Gaussian integers
• A Simple Estimate for the Number of Steps in the Euclidean Algorithm
• scientific article; zbMATH DE number 3853202
• On the average number of steps in the Euclidean algorithm

Cites work

• scientific article; zbMATH DE number 3657869 (Why is no real title available?)
• scientific article; zbMATH DE number 3743380 (Why is no real title available?)
• A Simple Estimate for the Number of Steps in the Euclidean Algorithm
• On the number of divisions of the Euclidean algorithm applied to Gaussian integers
• Shortest division chains in imaginary quadratic number fields
• The exact length of the Euclidean algorithm in [ X ]
• The number of steps in the Euclidean algorithm

Cited in

(5)

• scientific article; zbMATH DE number 3853202 (Why is no real title available?)
• scientific article; zbMATH DE number 3875409 (Why is no real title available?)
• The number of steps in the Euclidean algorithm
• \((1+i)\)-ary GCD computation in \(\mathbb Z[i]\) as an analogue to the binary GCD algorithm.
• The exact length of the Euclidean algorithm in [ X ]

This page was built for publication: The number of steps in the Euclidean algorithm over complex quadratic fields

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