| facts
|
|
|
The Euclidean algorithm is an efficient method for computing the greatest common divisor (GCD) |
|
|
It is named for the ancient Greek mathematician Euclid, who first described it |
|
|
The GCD of two numbers is the largest number that divides both of them without leaving a remainder |
|
more information: |
|
Euclidean algorithm |
| |
|
|
|
|
tags : euclidean, algorithm |
