# The Euclidean Algorithm

Initializing live version

Requires a Wolfram Notebook System

Interact on desktop, mobile and cloud with the free Wolfram Player or other Wolfram Language products.

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 (March 2011)

Suggested by: Stephen Wolfram

Open content licensed under CC BY-NC-SA

## Snapshots

## Details

## Permanent Citation