Question:** What is the greatest common factor of 72 and 108? - Simpleprint
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:
📰 These 7 Pokémon Violet Codes Will Make You Win the Game Overnight! 📰 Pokémon Violet Codes Exposed: Crack the Hidden Masterpieces Now! 📰 Find the Ultimate Pokémon Violet Codes—Skip the Guesswork Today! 📰 This Isnt Just A Christmas Movietyler Perry Madeea Deliver Maximum Drama Fire 📰 This Juicy Veal Chop Will Turn Your Dinner Into A Gourmet Showstopper 📰 This Kenan And Kel Episode Will Blow Your Mindrelive The Absolutely Crazy Moments 📰 This Las Vegas Bomb Trick Shocked Everyonewatch The Unbelievable Big Bet That Made Millions 📰 This Las Vegas Inspired Bomb Shot Drink Blasts Flavor You Need It In Your Top 5 📰 This Last Name Was Hidden In Plain Sightare You Ready To Uncover It 📰 This Legendary Ursula Alternate Reveals Her Untold Powercan It Change Everything 📰 This Legendary Wally West Flash Moment Will Shock Every Fan Forever Dont Miss 📰 This Legends Of Loot Hunt Uncharted 1S Shocking Truth You Need To See Now 📰 This Lego Wall E Epic Will Make You Tears You Wont Believe How Real It Looks 📰 This Library Room Was Closed For Years This Is What Happened When We Explored It 📰 This License Breaking Ps4 Game Until Dawn Benches Expectationswatch Now 📰 This Life Changing Ulnar Gutter Splint Fixes Wrist Pain In Secondsdo You Need It 📰 This Limited Edition Vivienne Westwood Wallet Is Everyones Latest Obsessiondont Miss Out 📰 This Live Experience At Txrhlive Is Too Wild To Ignorewatch NowFinal 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