Course contentsShow
← Mathematics
Lesson 2712 of 3,12154. Number TheoryFree lesson

Finding GCD by Listing Divisors

Practice finding the GCD of two numbers by listing all divisors and identifying the largest common one.

Finding GCD by Listing Divisors

You'll learn a straightforward, systematic method to find the greatest common divisor of two numbers by writing out all their divisors.

The Core Idea

The greatest common divisor (GCD) of two numbers is the largest positive integer that divides both numbers evenly. One direct way to find it is to:

  1. List all divisors of the first number
  2. List all divisors of the second number
  3. Identify which divisors appear in both lists (the common divisors)
  4. Pick the largest one

This method is especially practical for smaller numbers and helps build intuition about what the GCD really represents.

Step-by-Step Example

Let's find GCD(24, 36):

Divisors of 24:
Check which numbers divide 24: 1, 2, 3, 4, 6, 8, 12, 24

Divisors of 36:
Check which numbers divide 36: 1, 2, 3, 4, 6, 9, 12, 18, 36

Common divisors:
Numbers in both lists: 1, 2, 3, 4, 6, 12

Greatest common divisor:
The largest common divisor is 12, so GCD(24, 36) = 12.

Analogy

Think of divisors as "measurement sticks" that fit evenly into a length. The GCD is the longest stick that fits perfectly into both lengths—the biggest tool you can use to measure both numbers without remainder.

Why This Works

Since you're examining every divisor of both numbers, you're guaranteed to find all common ones. The largest in that set is by definition the GCD—no divisor can be larger and still divide both numbers.

Key Takeaway: Finding the GCD by listing divisors is a methodical, exhaustive approach that guarantees finding the largest number dividing both inputs—perfect for understanding and for smaller numbers.