Question:** What is the greatest common factor of 72 and 108? - Midis
What Is the Greatest Common Factor of 72 and 108? A Clear Explanation
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
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:
📰 BREAKING: Catherine Bell’s Bare Revelation Astounds Fans and Headlines Alike! 📰 Catherine Bell Nude Exposed? Inside the Stunning Gallery That’s Igniting Global Debate! 📰 Is This the Most Iconic Nude Photo of Catherine Bell? The Internet Can’t Stop Talking! 📰 3 Gingerbread Atat Shock The Hidden Ingredient Making It Unforgettable 📰 3 Golgo Golgo 13 Exposed They Didnt See This Terror Comingwatch Now 📰 3 Goofys Son Just Fixed His Reputationwatch The Heartwarming Comeback 📰 3 How Cersei Thrones Dominated Power Like No Queen Ever Haveyou Wont Believe Her Tactics 📰 3 Retro Gamers Are Litdownload This Must Play Game Hidden On Gamecube 📰 3 Secrets A Glass Dining Table Uses To Elevate Your Homes Lookyou Wont Believe 1 📰 3 The Most Stunning Xbox Game Pass Titles You Cant Ignoregames You Need To Try 📰 3 The Surprising Secret To Crispy Gluten Free Chicken Nuggets Every Craving Secret Just Dropped 📰 3 The Ultimate List Of Good Movies That Everyone Must Watch Proven By Top Critics 📰 3 The Untold Story Of Gargamel Gargamel Historys Real Dark Lord 📰 3 These Girls Backpacks Are Insaneheres Why Every Teen Needs One 📰 3 This 7 Day Gallbladder Diet Express Will Save Your Gallbladder Faster Than You Think 📰 3 This Goomy Pokmon Is Taking Gamers Wild The Secrets Inside Are Insane 📰 3 Top Secrets To Finding The Greatest Good Psp Games Youll Love 📰 3 Turn Your Garage Into A Fashion Hub With These Must Have Tank TopsFinal 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
