Input gcd(12) Result 12 Prime factorization 12 = 2^2×3 (3 prime factors, 2 distinct)

Input gcd(18, 24) Result 6

Input gcd(28, 48) Result 4

Input gcd(n1, n2) Alternative representation gcd(n1, n2) = (n1 n2)/(lcm(n1, n2)) for (n1 element Z and n1>0 and n2 element Z and n2>0)

Input gcd(36) Result 36 Prime factorization 36 = 2^2×3^2 (4 prime factors, 2 distinct)

Input gcd(10, 45) Result 5

Input gcd(100) Result 100 Prime factorization 100 = 2^2×5^2 (4 prime factors, 2 distinct)

Input gcd(12, 20) Result 4

Input gcd(12, 24) Result 12

Input gcd(12, 32) Result 4