Learn on PengiThe Art of Problem Solving: Prealgebra (AMC 8)Chapter 3: Number Theory

Lesson 7: Greatest Common Divisor

In this Grade 4 lesson from The Art of Problem Solving: Prealgebra (AMC 8), students learn how to find the greatest common divisor (gcd) of two or more integers by identifying common factors and using prime factorization. The lesson covers key concepts including common divisors, relatively prime integers, and a step-by-step method for computing the gcd by comparing the smallest powers of shared prime factors. Students also explore the relationship between gcd and divisibility, including how every common divisor of two numbers is itself a divisor of their gcd.

Section 1

Greatest Common Factor

Property

The greatest common factor or GCF of two whole numbers is the largest factor of both numbers. To find the GCF using prime factorization, multiply together all the prime factors that appear in the factorization of both numbers.

Examples

  • To find the GCF of 20 and 30, list their factors. Factors of 20 are {1, 2, 4, 5, 10, 20} and factors of 30 are {1, 2, 3, 5, 6, 10, 15, 30}. The largest factor in both lists is 10.
  • Find the GCF of 42 and 56 using prime factorization. We have 42=2×3×742 = 2 \times 3 \times 7 and 56=2×2×2×756 = 2 \times 2 \times 2 \times 7. The common factors are one 2 and one 7. So, the GCF=2×7=14\text{GCF} = 2 \times 7 = 14.
  • Let's find the GCF of 18 and 45. The prime factorizations are 18=2×3×318 = 2 \times 3 \times 3 and 45=3×3×545 = 3 \times 3 \times 5. The common prime factors are two 3s. Therefore, the GCF=3×3=9\text{GCF} = 3 \times 3 = 9.

Explanation

The GCF is the largest number that divides into two or more numbers without leaving a remainder. It's like finding the biggest identical group you can make from different sets of items. This is very useful for simplifying fractions.

Section 2

Relatively Prime Numbers

Property

Two integers aa and bb are relatively prime (or coprime) if and only if gcd(a,b)=1\gcd(a, b) = 1. When numbers are relatively prime, their least common multiple equals their product:

lcm(a,b)=ab when gcd(a,b)=1\text{lcm}(a, b) = a \cdot b \text{ when } \gcd(a, b) = 1

Examples

Section 3

GCD Scaling Property

Property

For positive integers aa, bb, and nn:

gcd(na,nb)=n×gcd(a,b)\gcd(na, nb) = n \times \gcd(a, b)

Examples

Book overview

Jump across lessons in the current chapter without opening the full course modal.

Continue this chapter

Chapter 3: Number Theory

  1. Lesson 1

    Lesson 1: Multiples

  2. Lesson 2

    Lesson 2: Divisibility Tests

  3. Lesson 3

    Lesson 3: Prime Numbers

  4. Lesson 4

    Lesson 4: Prime Factorization

  5. Lesson 5

    Lesson 5: Least Common Multiple

  6. Lesson 6

    Lesson 6: Divisors

  7. Lesson 7Current

    Lesson 7: Greatest Common Divisor

Lesson overview

Expand to review the lesson summary and core properties.

Expand

Section 1

Greatest Common Factor

Property

The greatest common factor or GCF of two whole numbers is the largest factor of both numbers. To find the GCF using prime factorization, multiply together all the prime factors that appear in the factorization of both numbers.

Examples

  • To find the GCF of 20 and 30, list their factors. Factors of 20 are {1, 2, 4, 5, 10, 20} and factors of 30 are {1, 2, 3, 5, 6, 10, 15, 30}. The largest factor in both lists is 10.
  • Find the GCF of 42 and 56 using prime factorization. We have 42=2×3×742 = 2 \times 3 \times 7 and 56=2×2×2×756 = 2 \times 2 \times 2 \times 7. The common factors are one 2 and one 7. So, the GCF=2×7=14\text{GCF} = 2 \times 7 = 14.
  • Let's find the GCF of 18 and 45. The prime factorizations are 18=2×3×318 = 2 \times 3 \times 3 and 45=3×3×545 = 3 \times 3 \times 5. The common prime factors are two 3s. Therefore, the GCF=3×3=9\text{GCF} = 3 \times 3 = 9.

Explanation

The GCF is the largest number that divides into two or more numbers without leaving a remainder. It's like finding the biggest identical group you can make from different sets of items. This is very useful for simplifying fractions.

Section 2

Relatively Prime Numbers

Property

Two integers aa and bb are relatively prime (or coprime) if and only if gcd(a,b)=1\gcd(a, b) = 1. When numbers are relatively prime, their least common multiple equals their product:

lcm(a,b)=ab when gcd(a,b)=1\text{lcm}(a, b) = a \cdot b \text{ when } \gcd(a, b) = 1

Examples

Section 3

GCD Scaling Property

Property

For positive integers aa, bb, and nn:

gcd(na,nb)=n×gcd(a,b)\gcd(na, nb) = n \times \gcd(a, b)

Examples

Book overview

Jump across lessons in the current chapter without opening the full course modal.

Continue this chapter

Chapter 3: Number Theory

  1. Lesson 1

    Lesson 1: Multiples

  2. Lesson 2

    Lesson 2: Divisibility Tests

  3. Lesson 3

    Lesson 3: Prime Numbers

  4. Lesson 4

    Lesson 4: Prime Factorization

  5. Lesson 5

    Lesson 5: Least Common Multiple

  6. Lesson 6

    Lesson 6: Divisors

  7. Lesson 7Current

    Lesson 7: Greatest Common Divisor