The Euclidean algorithm for Gaussian integers

@inproceedings{Rolletschek1983TheEA,
  title={The Euclidean algorithm for Gaussian integers},
  author={Heinrich Rolletschek},
  booktitle={EUROCAL},
  year={1983}
}
A theorem by Lam$ (1845) answers the following questions: given N, what is the maximum numher of divisions, if the Euclidean algorithm is applied to integers u, v with Neuene0? In this paper we give an analogous result for the Euclidean algorithm applied to Gaussian integers, that is, complex numSers a+bi, where a and b are integers. i. The problem. As is well-known, there exist a number of algebraic extension fields of Q, the field of rational numbers, in which the algebraic integers form a… CONTINUE READING
1 Citations
2 References
Similar Papers

Citations

Publications citing this paper.

References

Publications referenced by this paper.
Showing 1-2 of 2 references

Vorlesunger ueber Zahlentheorie

  • H. Hasse
  • 1964

Similar Papers

Loading similar papers…