Abstract
In 300 B.C. Euclid gave a remarkably simple procedure for finding the greatest common divisor of two integers. Since that time “Euclid’s Algorithm” has evolved to become one of the most useful tools in mathematics. In this chapter we will give a fairly complete treatment of Euclid’s algorithm.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 1987 Kluwer Academic Publishers
About this chapter
Cite this chapter
McEliece, R.J. (1987). Euclidean Domains and Euclid’s Algorithm. In: Finite Fields for Computer Scientists and Engineers. The Kluwer International Series in Engineering and Computer Science, vol 23. Springer, Boston, MA. https://doi.org/10.1007/978-1-4613-1983-2_2
Download citation
DOI: https://doi.org/10.1007/978-1-4613-1983-2_2
Publisher Name: Springer, Boston, MA
Print ISBN: 978-1-4612-9185-5
Online ISBN: 978-1-4613-1983-2
eBook Packages: Springer Book Archive