GCF of 48 and 64

Find the Greatest Common Factor (GCF) of 48 and 64 with a complete step-by-step solution. The GCF is the largest number that divides both numbers without leaving a remainder.

Answer: GCF(48, 64) = 16

Step-by-Step Solution

Step 1 Find the Factors of 48

To find the GCF of 48 and 64, we first need to find all factors of each number.

The factors of 48 are numbers that divide 48 evenly:

1 × 48 = 48, 2 × 24 = 48, 3 × 16 = 48, 4 × 12 = 48, 6 × 8 = 48

Factors of 48: 1, 2, 3, 4, 6, 8, 12, 16, 24, 48

Step 2 Find the Factors of 64

Now we find all factors of 64:

1 × 64 = 64, 2 × 32 = 64, 4 × 16 = 64, 8 × 8 = 64

Factors of 64: 1, 2, 4, 8, 16, 32, 64

Step 3 Find the Common Factors

The common factors are numbers that appear in both lists:

Factors of 48: 1, 2, 3, 4, 6, 8, 12, 16, 24, 48

Factors of 64: 1, 2, 4, 8, 16, 32, 64

Common factors: 1, 2, 4, 8, 16

The Greatest Common Factor is the largest of these: 16

Step 4 Prime Factorization Method

We can also find the GCF using prime factorization:

48 = 2^4 × 3

64 = 2^6

Take the common prime factors with the lowest powers:

GCF = 2 × 2 × 2 × 2 = 16

Step 5 Euclidean Algorithm

The Euclidean algorithm is a fast way to find the GCF using repeated division:

64 = 1 × 48 + 16

48 = 3 × 16 + 0

When the remainder is 0, the GCF is the last divisor: 16

Step 6 Final Answer

GCF(48, 64) = 16

GCF of 48 and 64

Related Calculations