Drexel dragonThe Math Forum

The Math Forum Internet Mathematics Library

The Euclidean Algorithm

Library Home || Full Table of Contents || Library Help

Visit this site: http://www.math.sc.edu/~sumner/numbertheory/euclidean/euclidean.html

Author:David Sumner
Description: Find the greatest common divisor (GCD) online using the Euclidean Algorithm. Enter two numbers, and the JavaScript calculates GCD, least common multiple (LCM), and linear combination; and displays the steps of the algorithm.

Levels: Middle School (6-8), High School (9-12)
Languages: English
Resource Types: Calculators, Web Interactive/Java
Math Topics: Division, Multiplication, Algorithms, Number Theory

[Privacy Policy] [Terms of Use]

Home || The Math Library || Quick Reference || Search || Help

© 1994- The Math Forum at NCTM. All rights reserved.