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

DOI10.1016/S0747-7171(86)80027-XzbMATH Open0609.12001MaRDI QIDQ1086616FDOQ1086616

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

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

Cites Work

• Fast computation of continued fraction expansions.
• A weakening of the euclidean property for integral domains and applications to algebraic number theory. I.
• The inhomogeneous minima of binary quadratic forms. I
• Euclid's Algorithm in real Quadratic Fields
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)

Cited In (9)

• A fast Euclidean algorithm for Gaussian integers
• The Kronecker-Vahlen theorem fails in real quadratic norm-Euclidean fields
• Shortest division chains in unique factorization domains
• Efficient solution of rational conics
• \((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
• On the asymptotic analysis of the Euclidean algorithm
• A Paper-and-Pencil gcd Algorithm for Gaussian Integers
• The number of steps in the Euclidean algorithm over complex quadratic fields

Recommendations

• Title not available (Why is that?) 👍 👎
• Title not available (Why is that?) 👍 👎
• Title not available (Why is that?) 👍 👎
• Divisors of the Gaussian integers in an arithmetic progression 👍 👎
• On the distribution of the greatest common divisor of Gaussian integers 👍 👎
• A fast Euclidean algorithm for Gaussian integers 👍 👎
• On the set of divisors of Gaussian integers 👍 👎
• The divisibility of Gaussian integers by large Gaussian primes 👍 👎
• Divisor problem in special sets of Gaussian integers 👍 👎
• A Paper-and-Pencil gcd Algorithm for Gaussian Integers 👍 👎

This page was built for publication: On the number of divisions of the Euclidean algorithm applied to Gaussian integers

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