+The **Euclidean algorithm** is an ancient, efficient method for finding the [Greatest Common Divisor](/wiki/greatest_common_divisor) (GCD) of two integers. It works by repeatedly dividing and taking remainders, elegantly simplifying the problem until the GCD emerges. This foundational concept is a cornerstone in [Number Theory](/wiki/number_theory) and computer science.
+## See also
+- [Least Common Multiple](/wiki/least_common_multiple)
+- [Modular Arithmetic](/wiki/modular_arithmetic)
+- [Algorithm](/wiki/algorithm)
... 1 more lines