Library Home || Full Table of Contents || Library Help
|Interactive Mathematics Miscellany and Puzzles, Alexander Bogomolny|
|An explanation of Euclid's algorithm for finding the greatest common divisor (gcd) of any pair of numbers, and a relation to the fundamental theorem of arithmetic, with links to related pages on Euclid's Game, binary Euclid's Algorithm, more on the gcd and the Fundamental Theorem of Arithmetic, an extension of the algorithm, the Stern-Brocot Tree, and the Farey series.|
|Levels:||Middle School (6-8), High School (9-12)|
|Math Topics:||Basic Operations, History and Biography, Number Theory|
© 1994- The Math Forum at NCTM. All rights reserved.