Euclidean AlgorithmYou are currentlybrowsing as guest. Click here to log in |
|
Devised by Euclid, the Euclidean Algorithm is a method for finding the greatest common divisor of two numbers.
Here's the algorithm:
As an example, consider 429 and 2002.
a | = | q | * | b | + | r |
2002 | = | 4 | * | 429 | + | 286 |
429 | = | 1 | * | 286 | + | 143 |
286 | = | 2 | * | 143 | + | 0 |
Enrichment Task
You should check that:
Last change to this page Full Page history Links to this page |
Edit this page (with sufficient authority) Change password |
Recent changes All pages Search |