유클리드 호제법
Also known as Euclid's algorithm, GCD algorithm
algorithm for computing greatest common divisors
AI overview
The Euclidean algorithm is a step-by-step procedure for finding the greatest common divisor of two numbers—that is, the largest number that divides evenly into both of them. It's one of the oldest and most efficient mathematical methods known, and it remains important in modern mathematics and computer science for solving problems involving divisibility and number relationships.
AI-generated from the Wikipedia summary — may contain errors.
Wikidata facts
- Image
- Euclidean algorithm 252 105 animation flipped.gif
Sources (3)
via Wikidata · CC0