GCF Calculator

What Is the Greatest Common Factor?

The greatest common factor (GCF), also called the greatest common divisor (GCD), is the largest number that divides evenly into two or more numbers. The GCF of 12 and 18 is 6 because 6 is the largest number that divides both 12 and 18 without a remainder. The GCF of 24, 36, and 60 is 12. Finding the GCF is essential for simplifying fractions, factoring expressions, and solving problems involving equal groups and distributions. Enter your numbers in the calculator above for an instant result.

How to Find the GCF?

Three methods work for finding the GCF. Listing factors: Write all factors of each number and find the largest common one. Factors of 36: 1, 2, 3, 4, 6, 9, 12, 18, 36. Factors of 48: 1, 2, 3, 4, 6, 8, 12, 16, 24, 48. Largest common: 12. Prime factorization: Break each number into primes and multiply the shared primes. 36 = 2² times 3². 48 = 2⁴ times 3. Shared: 2² times 3 = 12. Euclidean algorithm: Divide the larger by the smaller, then divide the previous divisor by the remainder, repeating until the remainder is 0. The last non-zero remainder is the GCF. For 48 and 36: 48/36 = 1 R12, 36/12 = 3 R0. GCF = 12.

GCF and Simplifying Fractions

To simplify a fraction, divide both numerator and denominator by their GCF. The fraction 24/36 has a GCF of 12, so 24/36 simplifies to 2/3. The fraction 45/60 has a GCF of 15, simplifying to 3/4. Without finding the GCF, you might simplify in multiple steps (divide by 2, then 3, etc.), but using the GCF reduces the fraction to lowest terms in a single step. This is why fraction calculators compute the GCF internally when displaying simplified results.

GCF vs LCM

The GCF is the largest number dividing all inputs. The LCM (least common multiple) is the smallest number that all inputs divide into. For 12 and 18: GCF = 6, LCM = 36. They are related by the formula: GCF times LCM = product of the two numbers (6 times 36 = 12 times 18 = 216). GCF is used for simplifying fractions and finding common divisors. LCM is used for finding common denominators and scheduling problems (when do two periodic events coincide?). Together they solve a wide range of number theory problems.

The Euclidean Algorithm

The Euclidean algorithm is the most efficient method for large numbers and dates back to 300 BCE. The steps: divide the larger number by the smaller, take the remainder, then divide the previous divisor by the remainder. Repeat until the remainder is 0. Example for GCF(252, 105): 252/105 = 2 R42, then 105/42 = 2 R21, then 42/21 = 2 R0. GCF = 21. This algorithm runs in logarithmic time, meaning it handles numbers with hundreds of digits efficiently. Modern encryption systems (RSA) use the extended Euclidean algorithm as a core component for computing modular inverses.

Real-World Applications of GCF

A teacher with 24 pencils and 36 erasers wants to make identical goodie bags with no supplies left over. The GCF (12) tells her she can make 12 bags, each containing 2 pencils and 3 erasers. A tiler working with a 48-inch by 36-inch area needs the largest square tiles that fit evenly: 12-inch tiles (the GCF). A farmer dividing a 150 by 90 meter field into the largest possible square plots uses GCF: 30-meter plots. Any situation requiring equal division without leftovers uses GCF to find the optimal grouping size.

GCF of More Than Two Numbers

To find the GCF of three or more numbers, find the GCF of the first two, then find the GCF of that result with the third number, and continue. GCF(24, 36, 60): GCF(24, 36) = 12, then GCF(12, 60) = 12. Alternatively, use prime factorization on all numbers simultaneously and take the lowest power of each shared prime. 24 = 2³ times 3, 36 = 2² times 3², 60 = 2² times 3 times 5. Shared primes at lowest powers: 2² times 3 = 12. Both methods give the same result and scale to any number of inputs. The calculator above handles any quantity of numbers and displays the GCF along with the complete factorization for educational reference.

Frequently asked questions