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

DOI10.1007/BF01931288zbMATH Open0731.11057MaRDI QIDQ807674FDOQ807674

John Knopfmacher, Arnold 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)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• On the number of divisions of the Euclidean algorithm applied to Gaussian integers
• Shortest division chains in imaginary quadratic number fields
• The number of steps in the Euclidean algorithm
• The exact length of the Euclidean algorithm in [ X ]
• A Simple Estimate for the Number of Steps in the Euclidean Algorithm

Cited In (1)

• \((1+i)\)-ary GCD computation in \(\mathbb Z[i]\) as an analogue to the binary GCD algorithm.

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)