+**Gcd** (greatest common divisor) is the largest positive integer that divides two or more integers without leaving a remainder, a cornerstone concept in [Number Theory](/wiki/number_theory). It illuminates a shared structure between numbers, often efficiently discovered through the [Euclidean Algorithm](/wiki/euclidean_algorithm).
+## See also
+- [Least Common Multiple](/wiki/least_common_multiple)
+- [Prime Number](/wiki/prime_number)
+- [Factor](/wiki/factor)
... 1 more lines