Step 1: Understanding the Concept:
The greatest common divisor (GCD) of two integers is the largest positive integer that divides both of them without leaving a remainder.
Step 2: Key Formula or Approach:
There are two common methods: listing the factors or using prime factorization.
Step 3: Detailed Explanation:
Method 1: Listing Factors
- Find all the positive divisors (factors) of 36: \{1, 2, 3, 4, 6, 9, 12, 18, 36\}
- Find all the positive divisors (factors) of 60: \{1, 2, 3, 4, 5, 6, 10, 12, 15, 20, 30, 60\}
- The common divisors are \{1, 2, 3, 4, 6, 12\}.
- The greatest among these common divisors is 12.
Method 2: Prime Factorization
- Find the prime factorization of 36: \( 36 = 2 \times 18 = 2 \times 2 \times 9 = 2^2 \times 3^2 \)
- Find the prime factorization of 60: \( 60 = 2 \times 30 = 2 \times 2 \times 15 = 2^2 \times 3 \times 5 \)
- To find the GCD, take the lowest power of each common prime factor and multiply them. The common prime factors are 2 and 3.
- Lowest power of 2 is \( 2^2 \).
- Lowest power of 3 is \( 3^1 \).
- GCD = \( 2^2 \times 3^1 = 4 \times 3 = 12 \).
Step 4: Final Answer:
The greatest common divisor of 36 and 60 is 12.