Drexel dragonThe Math ForumDonate to the Math Forum

The Math Forum Internet Mathematics Library

The Euclidean Algorithm

_____________________________________
Library Home || Full Table of Contents || Suggest a Link || 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-2014 Drexel University. All rights reserved.
http://mathforum.org/
The Math Forum is a research and educational enterprise of the Goodwin College of Professional Studies.The Math Forum is a research and educational enterprise of the Drexel University School of Education.