GCF of 45 and 60
Find the Greatest Common Factor (GCF) of 45 and 60 with a complete step-by-step solution. The GCF is the largest number that divides both numbers without leaving a remainder.
To find the GCF of 45 and 60, we first need to find all factors of each number.
The factors of 45 are numbers that divide 45 evenly:
Factors of 45: 1, 3, 5, 9, 15, 45
Now we find all factors of 60:
Factors of 60: 1, 2, 3, 4, 5, 6, 10, 12, 15, 20, 30, 60
The common factors are numbers that appear in both lists:
Factors of 45: 1, 3, 5, 9, 15, 45
Factors of 60: 1, 2, 3, 4, 5, 6, 10, 12, 15, 20, 30, 60
Common factors: 1, 3, 5, 15
The Greatest Common Factor is the largest of these: 15
We can also find the GCF using prime factorization:
Take the common prime factors with the lowest powers:
The Euclidean algorithm is a fast way to find the GCF using repeated division:
When the remainder is 0, the GCF is the last divisor: 15
GCF(45, 60) = 15