Where \(\gcd(m,n)\) is the greatest common factor (GCF) of \(m\) and \(n\).
The Greatest Common Factor (GCF) is the largest integer that divides both numbers without remainder. Methods:
Example: GCF(24, 36) = 12