Wolfram Research

Mathematica MathWorld Wolfram Science More »

The Euclidean Algorithm


	A graphical interpretation of Euclid's algorithm for calculating the greatest common divisor of two numbers: Given numbers and , draw a rectangle with width and height . If this rectangle is divided into squares as shown in the Demonstration, then the width of the smallest square (shown in red) is the greatest common divisor of and .


	Contributed by: Matthew Szudzik Suggested by: Stephen Wolfram

Euclidean Algorithm (Wolfram MathWorld)

History of Continued Fractions (NKS|Online)

"The Euclidean Algorithm" from The Wolfram Demonstrations Project
http://demonstrations.wolfram.com/TheEuclideanAlgorithm/

Contributed by: Matthew Szudzik

Suggested by: Stephen Wolfram

Report an issue »

Interact with Demonstrations using the latest version of the free Mathematica Player—Download Now

Related Topics

Browse all topics

Browse all education topics

Some Related Demonstrations

Share & Bookmark This Demonstration

Contribute

Powered by Wolfram Mathematica

Give us your feedback

	Source page:
	Email	Name (optional)
	Occupation (optional)	Organization (optional)
	I use Mathematica often occasionally never
	Country (optional) Remember me
	Note: Please do not include anything you consider confidential or proprietary. Your message and contact information may be shared with the author of any specific Demonstration for which you give feedback, but will not otherwise be published or distributed. Privacy Policy »

© 2009 Wolfram Demonstrations Project & Contributors

Wolfram Research

Site Index

RSS

Atom

Note: To run this Demonstration you need the free
Mathematica Player or Mathematica 7+