Question:** What is the greatest common factor of 72 and 108? - Parker Core Knowledge
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
Image Gallery
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:
📰 3; Unlock Fast Workflow Secrets: How Excels DAY OF WEEK Function Works (Time-Savers Inside!) 📰 4; From Confusion to Confidence: Master Excels D 📰 Unlock Big Savings: The Ultimate NPV Function in Excel You Need to Know Today! 📰 Express Vpn Download Mac 9729002 📰 Unleash Chaos Rainbow Six Siege X Mods Take Co Ops To Unreal Alt Levels Top Secrets Revealed 4743677 📰 Helena Zengel 9727387 📰 Dentists Fear This Common Sightdry Socket Vs Soft Healing A Battle Beneath Your Gums 3070468 📰 Barber Studio Ann Arbor 3826297 📰 Amazon Sde 1 8170260 📰 The Ultimate Guide To The Most Stylish Cheongsam Dress For Every Occasion 18658 📰 2010 Forester 3643511 📰 Fantastic Beasts 2 The Most Stunning Secrets Exposeddont Click Without Seeing These Reveals 6120146 📰 Exchange Rate Dollar To Rupee 6504727 📰 Bess Spain City Deadly Secret Revealed In Shocking Discovery 9900718 📰 This Picture Found Meand I Loathe The Person I Sawheres Why 678417 📰 Yahoo Just Spotted Malen Stockheres Why Its A Must Buy Before It Explodes 4793436 📰 The Force Outside Will Shatter Your Bowyou Wont Believe What Happens Next 1652810 📰 Game Marauder 1970411Final 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
