A Concrete Introduction to Higher Algebra pp 25-46 | Cite as

# Euclid’s Algorithm

Chapter

## Abstract

Euclid’s algorithm for finding the greatest common divisor of two numbers dates from the fourth century b.c. but remains one of the fastest algorithms available in modern computational number theory. In this chapter we look at Euclid’s algorithm and its immediate consequences, analyze its speed, and, as an interesting aside, discuss a speculative connection between Euclid’s algorithm and classical Greek proofs that √n is irrational when *n* is not a square.

## Preview

Unable to display preview. Download preview PDF.

## Copyright information

© Springer Science+Business Media New York 1995