Solves the GCD (Greatest Common Divisor) using the Euclidean Algorithm (Alternate alias of gcf)
gcf
gcd(1920, 1080); // 120gcd(2, 2); // 2 Copy
gcd(1920, 1080); // 120gcd(2, 2); // 2
Solves the GCF (Greatest Common Factor) using the Euclidean Algorithm
gcf(1920, 1080); // 120gcf(2, 2); // 2 Copy
gcf(1920, 1080); // 120gcf(2, 2); // 2
Solves the GCD (Greatest Common Divisor) using the Euclidean Algorithm (Alternate alias of
gcf)Param: a
Param: b
Returns
Usage