Algorithms 1 — Miscellaneous

Computer Algebra

Volume 162 of the series Lecture Notes in Computer Science pp 12-23

Date:

The Euclidean algorithm for Gaussian integers

  • Heinrich RolletschekAffiliated withDepartment of Computer and Information Sciences, University of Delaware

* Final gross prices may vary according to local VAT.

Get Access

Abstract

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.