algorithme d'Euclide
Also known as Euclid's algorithm, GCD algorithm
algorithme d'arithmétique calculant le PGCD de deux entiers
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
Article · Français
En mathématiques, l'algorithme d'Euclide est un algorithme qui calcule le plus grand commun diviseur (PGCD) de deux entiers, c'est-à-dire le plus grand entier qui divise les deux entiers, en laissant un reste nul. L'algorithme ne requiert pas de connaître la factorisation de ces deux nombres.
Abstract from DBpedia / Wikipedia · CC BY-SA