+The **Greatest Common Divisor** (GCD) is the largest positive [integer](/wiki/integer) that divides two or more numbers without a remainder. It reveals a fundamental shared factor, simplifying fractions and foundational to [number theory](/wiki/number_theory).
+## See also
+- [Divisor](/wiki/divisor)
+- [Euclidean Algorithm](/wiki/euclidean_algorithm)
+- [Least Common Multiple](/wiki/least_common_multiple)
... 1 more lines