On the number of divisions of the Euclidean algorithm applied to Gaussian integers

DOI10.1016/S0747-7171(86)80027-XzbMath0609.12001MaRDI QIDQ1086616

Heinrich Rolletschek

Publication date: 1986

Published in: Journal of Symbolic Computation (Search for Journal in Brave)

zbMATH Keywords

Euclidean algorithmGaussian number fieldGaussian integerdivisor chains

Mathematics Subject Classification ID

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

Related Items

Shortest division chains in unique factorization domains ⋮ Efficient solution of rational conics ⋮ On the asymptotic analysis of the Euclidean algorithm ⋮ The Kronecker-Vahlen theorem fails in real quadratic norm-Euclidean fields ⋮ \((1+i)\)-ary GCD computation in \(\mathbb Z[i\) as an analogue to the binary GCD algorithm.] ⋮ Shortest division chains in imaginary quadratic number fields ⋮ A fast Euclidean algorithm for Gaussian integers ⋮ The number of steps in the Euclidean algorithm over complex quadratic fields

Cites Work

• Fast computation of continued fraction expansions.
• The inhomogeneous minima of binary quadratic forms. I
• A weakening of the euclidean property for integral domains and applications to algebraic number theory. I.
• Euclid's Algorithm in real Quadratic Fields
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item