Back to Discover
🔢

Euclidean algorithm

math Maturity 7-9

We can find a special number. It is the biggest number that fits into two other numbers. A man named Euclid found this a long time ago. It helps us work with numbers. Can you find a big number that fits into two small ones?

52 words
🖼️ Images & Media (9)
File:Euclid's algorithm Book VII Proposition 2 3.svg
Euclid's algorithm Book VII Proposition 2 3.svg
File:24x60.svg
24x60.svg
File:Euclidean algorithm 1071 462.gif
Euclidean algorithm 1071 462.gif
File:Euklid.jpg
Euklid.jpg
File:Diophante Bezout.svg
Diophante Bezout.svg
File:SternBrocotTree.svg
SternBrocotTree.svg
File:Euclidean Algorithm Running Time.svg
Euclidean Algorithm Running Time.svg
File:Gaussian primes.svg
Gaussian primes.svg
File:Eisenstein primes.svg
Eisenstein primes.svg
Up Next
🔢
Greatest common divisor
Math
→
More to explore

✨ What else?

Related topics you might enjoy

Greatest common divisor 0% Extended Euclidean algorithm 0% Algorithm 0% Coprime integers 0% Euclid's Elements 0% Factorization 0%

🔬 Go deeper

More advanced topics to explore

Extended Euclidean algorithm Algorithm Euclid's Elements Factorization

🪜 Step back

Simpler topics to build understanding

Greatest common divisor Coprime integers Least common multiple Prime number
📚 Content adapted from Wikipedia | Readability: FK 12.3 | Vital Level 4