Math Problem Solver

Method 1:

\(6\) is the greatest common divisor of \(12\) and \(30\).

The greatest common divisor of two integers is the largest positive integer that divides both integers.

The greatest common divisor of integers \(b\) and \(a\) is written as \(\operatorname{gcd}(b,a)\).

The greatest common divisor can be computed by Euclid's algorithm, which is based on repeated application of the following fact:\[\operatorname{gcd}(b, a) = \operatorname{gcd}(a, r)\] where \(r\) is the remainder of \(b\) divided by \(a\), and \(0 < a \le b\).

Euclid's algorithm for computing the greatest common divisor of \(12\) and \(30\):

\(\operatorname{gcd}(30, 12) = \operatorname{gcd}(12, 6)\), since \(6\) is the remainder when \(30\) is divided by \(12\).

\(\operatorname{gcd}(12, 6) = 6\), since \(6\) divides \(12\).

Method 2:

The greatest common divisor of two integers is the largest positive integer that divides both integers.

The prime factorization of $12$ is $2^{2} \times 3$.

The prime factorization of $30$ is $2 \times 3 \times 5$.

The GCD is the minimum of the prime powers of the two numbers. Find the greatest common divisor by multiplying the prime number powers together, including only the lowest prime number power of those prime factors which are common to both numbers.

$\text{gcd}(12, 30) = 2 \times 3 = 6.$