What Is The Greatest Common Factor Of 60 And 90

The Greatest Common Factor of 60 and 90

Let's cut right to it: the greatest common factor (GCF) of 60 and 90 is 30.

That's the short answer. Maybe you're brushing up on basic math, helping a kid with homework, or just curious about how these things work. But if you're here reading about this, you probably want to know why it's 30, not just what it is. Either way, this is one of those concepts that seems simple once you get it but can feel confusing the first time around.

So let's walk through it together. No rush.

What Is the Greatest Common Factor?

Before we dive into 60 and 90 specifically, let's make sure we're on the same page about what a "greatest common factor" actually means.

The greatest common factor of two numbers is the largest number that divides both of them evenly, with no remainder. That's it. Even so, no magic, no tricks. Just the biggest shared divisor.

Take 60 and 90, for example. Both numbers can be divided by 1, 2, 3, 5, 6, 10, 15, and 30 without leaving anything behind. Out of all those shared factors, 30 is the largest one. So 30 is the GCF.

It's worth knowing that the GCF is sometimes called the greatest common divisor (GCD), and the two terms are used interchangeably in math. Same idea, different name.

Why Does This Matter?

You might be thinking: "Okay, cool, 30. Why should I care?" Fair question.

Understanding how to find the GCF comes in handy more often than you'd expect. One of the most common uses is in simplifying fractions. Even so, if you ever needed to reduce 60/90 to its simplest form, you'd divide both the numerator and denominator by their GCF, which is 30. That gives you 2/3, and you're done.

The GCF also shows up in real-world scenarios, believe it or not. Say you're tiling a rectangular floor that measures 60 inches by 90 inches, and you want to use square tiles that are as large as possible without cutting any. So the side length of those tiles would be the GCF of 60 and 90, which is 30 inches. You'd fit exactly two tiles along the shorter side and three along the longer side.

It's one of those foundational math skills that keeps popping up, even when you're not expecting it.

How to Find the GCF of 60 and 90

There are a few different ways to find the GCF of two numbers. Let's look at the most common methods, and I'll walk you through each one using 60 and 90.

Listing the Factors

The most straightforward approach is to list out all the factors of each number and then find the largest one they have in common.

Factors of 60: 1, 2, 3, 4, 5, 6, 10, 12, 15, 20, 30, 60
Factors of 90: 1, 2, 3, 5, 6, 9, 10, 15, 18, 30, 45, 90

Now compare the two lists. This leads to the largest of these is 30. Consider this: the common factors are 1, 2, 3, 5, 6, 10, 15, and 30. So the GCF is 30.

This method works well for smaller numbers, but it can get tedious with larger ones. That's where other methods come in handy.

Prime Factorization

Prime factorization breaks each number down into its prime number building blocks. Here's how it works for 60 and 90.

Start with 60:
60 = 2 × 30
60 = 2 × 2 × 15
60 = 2 × 2 × 3 × 5

So the prime factorization of 60 is 2² × 3 × 5.

Now for 90:
90 = 2 × 45
90 = 2 × 3 × 15
90 = 2 × 3 × 3 × 5

So the prime factorization of 90 is 2 × 3² × 5.

To find the GCF using prime factorization, identify the common prime factors and take the lowest power of each.

Both numbers have:

One factor of 2 (the lowest power is 2¹)
One factor of 3 (the lowest power is 3¹)
One factor of 5 (the lowest power is 5¹)

Multiply those together: 2 × 3 × 5 = 30.

And there's your GCF again: 30.

The Euclidean Algorithm

This one feels like a magic trick once you get the hang of it. The Euclidean algorithm is based on the idea that the GCF of two numbers also divides their difference. Here's how it works:

Want to learn more? We recommend which speaker would most benefit from joining an interest group and 91 more than the square of a number for further reading.

Start with 90 and 60.
Divide 90 by 60: 90 ÷ 60 = 1 with a remainder of 30.
Now find the GCF of 60 and 30 (the remainder).
Divide 60 by 30: 60 ÷ 30 = 2 with a remainder of 0.

Every time you hit a remainder of 0, the last non-zero remainder is the GCF. In this case, that's 30.

The Euclidean algorithm is especially efficient for large numbers. For 60 and 90, it's a bit overkill, but it's good to know it exists.

Common Mistakes People Make

Even something that seems straightforward can trip people up. Here are a few mistakes I've seen (and honestly, made myself back in the day).

Stopping Too Early

Some people list out the factors and stop as soon as they find a common one, rather than checking if there's a larger one. As an example, they might see that both 60 and 90 are divisible by 10 and call it a day. But 10 isn't the greatest common factor. You've got to keep going until you're sure you've found the largest one.

Mixing Up GCF and LCM

The greatest common factor and the least common multiple are related but very different concepts. The GCF is the largest number that divides both, while the LCM is the smallest number that both divide into. Confusing the two is easy, especially under time pressure.

Forgetting to Check All Factors

When listing factors, it's easy to miss one or two, especially if you're going fast. Because of that, missing a factor can lead you to the wrong GCF. Double-checking your work is always worth it.

Practical Tips That Actually Work

Here are a few things that can make finding the GCF less of a headache.

Start with the Obvious

Before diving into prime factorization or the Euclidean algorithm, see if there's an obvious common factor you can spot right away. For 60 and 90, both end in 0, so 10 is clearly a factor. In practice, that's a starting point. From there, you can ask yourself if there's something larger.

Use Prime Factorization for Medium-Sized Numbers

If the numbers aren't too big, prime factorization is usually the most reliable method. It might take a little longer, but it's systematic and leaves less room for error.

Save the Euclidean Algorithm for When You Need Speed

Once you're comfortable with it, the Euclidean algorithm is the fastest way to find the GCF, especially for larger numbers. It's also a great example of how ancient math techniques can still be incredibly useful today.

Practice with Different Pairs

The more you work with different number pairs, the more intuitive it becomes. Try finding the GCF of 24 and 36, or 48 and 72. You'll start to notice patterns and shortcuts that make the process faster.

Frequently Asked Questions

What's the difference between GCF and GCD?

What's the difference between GCF and GCD?
While the terms are often used interchangeably, there's a subtle distinction in context. GCF (Greatest Common Factor) is the more common phrasing in elementary mathematics, focusing on the "factor" aspect—identifying the largest whole number that divides a set of numbers exactly. GCD (Greatest Common Divisor) tends to appear in more advanced algebra, number theory, and computer science, emphasizing the "divisor" perspective. Mathematically, they produce identical results: the largest positive integer that divides each number in the set without a remainder. The choice of term usually depends on the curriculum or field, but the underlying concept and answer remain the same.

Conclusion
Finding the greatest common factor is more than just a classroom exercise—it's a practical tool that simplifies fractions, helps solve ratio problems,

and scales recipes or measurements down to their most manageable terms. Mastering this skill builds the number sense necessary for higher algebra, polynomial factoring, and even cryptography. Because of that, like most mathematical concepts, fluency comes with practice—so the next time you encounter a pair of numbers, take a moment to find their GCF. Even so, whether you're using prime factorization for clarity, the Euclidean algorithm for speed, or simple inspection for smaller pairs, the goal remains the same: identifying that shared foundation between numbers. You’ll often find the problem becomes simpler once you do.