Course contentsShow
← Mathematics
Lesson 356 of 3,12110. FactoringFree lesson

Finding the GCF of Numbers

Find the GCF of integers using listing, prime factorization, or the Euclidean algorithm.

Finding the GCF of Numbers

You'll learn three practical methods to find the greatest common factor of any set of integers.

What Is the GCF and Why Find It?

You already know what the GCF is—the largest number that divides evenly into all given numbers. Now you need efficient ways to find it. Whether you're working with small numbers or large ones, having multiple strategies helps you choose the fastest path.

Method 1: Listing Factors

List all factors of each number, then identify the largest factor they share.

Example: Find the GCF of 12 and 18.

  • Factors of 12: 1, 2, 3, 4, 6, 12
  • Factors of 18: 1, 2, 3, 6, 9, 18
  • Common factors: 1, 2, 3, 6
  • GCF = 6

This works great for small numbers but becomes tedious with larger ones.

Method 2: Prime Factorization

Break each number into prime factors, then multiply the common primes raised to their lowest powers.

Example: Find the GCF of 24 and 36.

  • 24 = 2³ × 3¹
  • 36 = 2² × 3²
  • Common primes: 2 and 3
  • Lowest powers: 2² and 3¹
  • GCF = 2² × 3¹ = 4 × 3 = 12

Method 3: Euclidean Algorithm

Repeatedly divide and use remainders until you reach zero. The last non-zero remainder is the GCF.

Example: Find the GCF of 48 and 18.

  • 48 ÷ 18 = 2 remainder 12
  • 18 ÷ 12 = 1 remainder 6
  • 12 ÷ 6 = 2 remainder 0
  • GCF = 6

This method is fastest for large numbers and requires no factoring!

Key Takeaway: You can find the GCF by listing factors (simple but slow), prime factorization (systematic and clear), or the Euclidean algorithm (fast for any size numbers).