DomainTools.com |
 |
||
|
|
||
| Language: | ||||||||||||
 |
 |
 |
 |
 |
 |
 |
 |
 |
 |
 |
 |
|
| Domains: | 16 |
0 |
0 |
0 |
0 |
0 |
0 |
0 |
0 |
0 |
0 |
0 |
Euclidean algorithm references on wikipedia
Euclidean_algorithm
In mathematics, the Euclidean algorithm is an efficient method for computing the greatest common divisor (GCD), also known as the greatest common factor (GCF) or highest common factor (HCF). The algorithm is also called Euclid's algorithm, after the Greek mathematician Euclid, who described it in Books[[
In mathematics, the Euclidean algorithm is an efficient method for computing the greatest common divisor (GCD), also known as the greatest common factor (GCF) or highest common factor (HCF). The algorithm is also called Euclid's algorithm, after the Greek mathematician Euclid, who described it in Books[[
| Description | |||
 Arxiv.org | arXiv.org e-Print archive | ||
| Colorado.edu | University of Colorado at Boulder | ||
| Cut-the-knot.org | Interactive Mathematics Miscellany and Puzzles, Index | ||
| Doi.org | The Digital Object Identifier System | ||
| Google.com | Google | ||
| Liu.se | Linköping University | ||
| Loc.gov | Library of Congress Home | ||
| Mathpages.com | MathPages | ||
| Maths.org | Maths.org | ||
| Planetmath.org | PlanetMath | ||
| Projecteuclid.org | Project Euclid - mathematics and statistics resources online | ||
| Queensu.ca | Queen s University | ||
| Sc.edu | University of South Carolina | ||
| Sciencenews.org | Science News | ||
| Springerlink.com | Springerlink.com | ||
| Wolfram.com | Wolfram Research: Mathematica, Technical and Scientific Software | ||
