Question:** What is the greatest common factor of 72 and 108?

What Is the Greatest Common Factor of 72 and 108? A Clear Explanation

When working with numbers in math, one key concept students frequently encounter is the greatest common factor (GCF), also known as the greatest common divisor (GCD). If you’ve ever asked, “What is the greatest common factor of 72 and 108?”—you’re on the right track to mastering this essential concept. In this article, we’ll explore the GCF of 72 and 108 in detail, including step-by-step calculation methods and why understanding this number matters in math.

Understanding the Context

Understanding the Greatest Common Factor (GCF)

The greatest common factor of two or more integers is the largest positive integer that divides all of them without leaving a remainder. For example, the GCF of 72 and 108 is the largest number that evenly divides both 72 and 108.

How to Find the GCF of 72 and 108

Question:** What is the greatest common factor of 72 and 108?

Key Insights

There are three common methods to calculate the GCF:

Prime Factorization
Listing Factors
Using the Euclidean Algorithm

1. Prime Factorization Method

Break each number into its prime factors:

72 = 2³ × 3²
108 = 2² × 3³

Now, identify the lowest exponent of each common prime factor:

🔗 Related Articles You Might Like:

📰 The Shocking Truth About Partial vs Full Highlights All Creators Should See 📰 Partial Highlights Are Cheating Your Highlight Reel—Here’s Why It Matters! 📰 Part 4 of JoJo’s dernier destroyer Revealed—You Won’t Believe How This Climax Unfolds! 📰 Handrail Stair Railings That Fall In Love With Every Step Shop Now 📰 Handshake Meme That Doubles As The Ultimate Clickbait Clip Watch Now 📰 Handsome Spain Defeats Expectations The Magnificent Heart Of Southern Europe 📰 Handsome Spain Exposed Where Charisma Meets Breathtaking Beauty Culture 📰 Handsome Spain Stuns The World This Stunning Region Won Global Heartstrings 📰 Handwriting Without Tears Why Every Childs Writing Routine Must Change 📰 Handwritten Heartfelt Happy Birthday In Cursive That Every Moment Deserves 📰 Handyman In Another World Stunning Secrets Behind His Amazing Repairs 📰 Hang More Clutter Less The Shocking Hanger Wall Hanger Revealed 📰 Hang Your Hat On These 7 Classic Trendy Hat Types Everyone Loves 📰 Hanging Basket Basket Hacks That Will Make Your Garden Instagram Famous 📰 Hanging Chairs That Look Like Theyre Defying Gravity Shop Now Before Its Gone 📰 Hanging Hyena Alert This Spicy Encounter Left Town Shocked 📰 Hanging Knee Raises The Secret Move Thatll Magically Fire Up Your Lower Abs 📰 Hanging Out With Friends Lifes Greatest Secret To Endless Fun Memories

Final Thoughts

Common primes: 2 and 3
Smallest exponent of 2: 2¹ (or 2², taking the minimum of 2² and 2³ → 2²)
Smallest exponent of 3: 3²

Multiply these together:
GCF = 2² × 3² = 4 × 9 = 36

2. Listing Factors (Suitable for Smaller Numbers)

List all factors of each number:

Factors of 72: 1, 2, 3, 4, 6, 8, 9, 12, 18, 24, 36, 72
Factors of 108: 1, 2, 3, 4, 6, 9, 12, 18, 27, 36, 54, 108

The largest number appearing in both lists is 36.

3. Euclidean Algorithm (Efficient for Large Numbers)

The Euclidean algorithm uses repeated division. Here’s how it works:

Divide the larger number by the smaller: 108 ÷ 72 = 1 with remainder 36
Now divide 72 by 36: 72 ÷ 36 = 2 with remainder 0
When the remainder is 0, the last non-zero remainder is the GCF

So, GCF(72, 108) = 36