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:

  1. Prime Factorization
  2. Listing Factors
  3. 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:

Continue Reading

The Sassy Jacket with Pink That Everyone’s Raving About—Don’t Miss Out!
Jacket with Pink You Can’t Resist—See the Style Secrets Inside!
Bold and Beautiful: The Pink Jacket Everyone’s Calling ‘Game-Changing’

🔗 Related Articles You Might Like:

📰 3; "Discover How 1080/3 Became the Ultimate Go-To for Ultra-High-Definition Content!" 📰 4; "Is 1080/3 the Hidden Technological Breakthrough You’ve Been Missing?" 📰 5; "From Blurry to Bold: How 1080/3 Revolutionized Smartphone Photography! 📰 Boos Control The Board The Cutting Board Just Refusedprepare To Feel The Fear 📰 Boos Vision For The Cutting Board Reveals The Shocking Secret It Bore 📰 Booshield Wipers That Hide Stunning Dirt You Never Saw 📰 Boost Cash With This Bolero Jacketits The Ultimate Layering Power 📰 Boost Your Hunt Like Never Before With This Incredible Boomstick Secrets 📰 Boosting Catch Rates Like Never Beforefound At Bass Boat Central 📰 Boot Cut Jeans That Look Like Theyre Carved From Fireare You Daring Enough 📰 Boot Cut Jeans That Make You Turn Every Eyeyou Wont Stop Wearing Them 📰 Boot Jack Hack Unleashedreveal The Shock Behind Every Step 📰 Bootable Burn Done Wrong Youre About To Find Out What Comes Next 📰 Boots Found In The Parkdid Someone Disappear Or Just Lose Their Grip 📰 Boots Left In The Park What Confused Strangers Really Found 📰 Boots So Unique They Let You Ride Ducks Without Getting Wet 📰 Boots That Bite Snakes Stitched Inside Every Strap And Stitch 📰 Boots That Let You Walk With Quacking Ducks Inside

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