The Euclidean algorithm for Gaussian integers

  • Heinrich Rolletschek
Algorithms 1 — Miscellaneous
Part of the Lecture Notes in Computer Science book series (LNCS, volume 162)


A theorem by Lamé (1845) answers the following questions: given N, what is the maximum number of divisions, if the Euclidean algorithm is applied to integers u, v with N≥u≥n≥0? In this paper we give an analogous result for the Euclidean algorithm applied to Gaussian integers, that is, complex numbers a+bi, where a and b are integers.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag 1983

Authors and Affiliations

  • Heinrich Rolletschek
    • 1
  1. 1.Department of Computer and Information SciencesUniversity of DelawareNewarkUSA

Personalised recommendations