Euclidean Algorithm Essay

925 Words4 Pages
Euclidean Algorithm is an algorithm that is used to find the greatest common factor (GCF) of two numbers. It is based on the principle that the greatest common factor of two numbers does not change if the smaller number is subtracted from the larger number. It was developed by the Greek Mathematician Euclid, and described in his book the Elements. In Elements it is formulated for integers and the lengths of line segments. It has numerous mathematical applications, and is the oldest algorithm to survive to the present day. Euclid’s algorithm contributed to understanding of the number theory, and helped prove many other theories and identities. Euclid of Alexandria was a Greek Mathematician during the reign of Ptolemy (O’Connor). His most famous mathematical work was the Elements. It is a collection of definitions, postulates (axioms), propositions (theorems and constructions), and mathematical proofs of the propositions (Robertson). It is in this book that he explains his algorithm for finding the greatest common divisor of two numbers. He explains that this only applies to numbers that are not prime. The algorithm was an important part to understanding integers and is still relevant today. The fact that it is so old and still in use shows its significance to understanding integers and Mathematics. Euclid stated that the algorithm is used “given two numbers not prime to one another, to find their greatest common measure” (Euclid). It is a set of rules for finding the greatest common factor or divisor of two numbers in a finite number of steps. To start, the two numbers that you are looking for cannot be prime numbers. This means both numbers must have a positive divisor other than 1 and themselves. If they are not the greatest common divisor will always be 1. The Euclidean algorithm is based on the principle that the greatest common divisor of two numbers does not

More about Euclidean Algorithm Essay

Open Document