Find Greatest Common Factor Of Two Numbers Calculator

What is the Greatest Common Factor (GCF)?

The Greatest Common Factor (GCF) of two or more non-zero integers is the largest positive integer that divides each of the integers without leaving a remainder. It is also commonly known as the Greatest Common Divisor (GCD) or Highest Common Factor (HCF). Our Greatest Common Factor Calculator helps you find this value quickly.

For example, the GCF of 12 and 18 is 6, because 6 is the largest number that divides both 12 (12 ÷ 6 = 2) and 18 (18 ÷ 6 = 3) exactly.

Who should use the Greatest Common Factor Calculator?

Students: Learning about number theory, fractions, and the Euclidean algorithm.
Teachers: Demonstrating concepts of GCF and GCD in mathematics.
Mathematicians: Quickly finding the GCF of two numbers for various calculations.
Programmers: Implementing algorithms that require GCF, such as simplifying fractions.
Anyone needing to simplify fractions or solve problems involving the division of quantities into equal largest groups.

Common Misconceptions about the GCF

GCF vs. LCM: The GCF is the largest number that divides into both numbers, while the Least Common Multiple (LCM) is the smallest number that both numbers divide into. Don’t confuse the two; our Least Common Multiple Calculator can help with LCM.
GCF is always smaller: The GCF of two numbers is always less than or equal to the smaller of the two numbers. It can be equal if one number is a multiple of the other.
GCF of prime numbers: The GCF of two distinct prime numbers is always 1.

Greatest Common Factor Formula and Mathematical Explanation

The most efficient method to find the GCF of two numbers, say ‘a’ and ‘b’, is the Euclidean Algorithm. The algorithm is based on the principle that the greatest common divisor of two numbers does not change if the larger number is replaced by its difference with the smaller number. This process is repeated until one of the numbers becomes zero, at which point the other number is the GCF. More efficiently, the larger number is replaced by its remainder when divided by the smaller number.

Let’s say we want to find GCF(a, b), where a > b:

Divide ‘a’ by ‘b’ and find the remainder ‘r’. So, a = qb + r, where 0 ≤ r < b.
If r = 0, then GCF(a, b) = b.
If r ≠ 0, replace ‘a’ with ‘b’ and ‘b’ with ‘r’, and repeat step 1.

This process is guaranteed to terminate because the remainders decrease with each step.

Variables Table

Variable	Meaning	Unit	Typical Range
a	The first number (or the larger number in a step of the algorithm)	Dimensionless (integer)	Positive integers
b	The second number (or the smaller number in a step of the algorithm)	Dimensionless (integer)	Positive integers (or zero in the last step)
r	The remainder when ‘a’ is divided by ‘b’	Dimensionless (integer)	0 ≤ r < b
GCF(a, b)	The Greatest Common Factor of a and b	Dimensionless (integer)	Positive integers

Our Greatest Common Factor Calculator implements this algorithm.

Practical Examples (Real-World Use Cases)

Example 1: Simplifying Fractions

Suppose you have the fraction 48/60 and you want to simplify it. You need to find the GCF of 48 and 60.

Using the Euclidean Algorithm (or our Greatest Common Factor Calculator): GCF(60, 48) -> 60 = 1*48 + 12 -> GCF(48, 12) -> 48 = 4*12 + 0. The GCF is 12.
Divide both numerator and denominator by 12: 48 ÷ 12 = 4, 60 ÷ 12 = 5.
The simplified fraction is 4/5. You might find our Simplify Fractions Calculator useful too.

Example 2: Dividing Items into Groups

Imagine you have 90 red marbles and 120 blue marbles, and you want to divide them into identical groups, with each group having the same number of red marbles and the same number of blue marbles, and you want to make as many groups as possible.

You need to find the GCF of 90 and 120.
Using the Greatest Common Factor Calculator or manually: GCF(120, 90) -> 120 = 1*90 + 30 -> GCF(90, 30) -> 90 = 3*30 + 0. The GCF is 30.
This means you can form 30 groups. Each group will have 90/30 = 3 red marbles and 120/30 = 4 blue marbles.

How to Use This Greatest Common Factor Calculator

Enter the First Number: Input the first positive integer into the “First Number” field.
Enter the Second Number: Input the second positive integer into the “Second Number” field.
Calculate: The calculator will automatically update as you type, or you can click the “Calculate GCF” button.
View Results: The primary result shows the GCF. You’ll also see a table detailing the steps of the Euclidean algorithm and a bar chart comparing the numbers and their GCF.
Reset: Click “Reset” to clear the inputs to their default values.
Copy Results: Click “Copy Results” to copy the GCF and input numbers to your clipboard.

Reading the Results

The main result is the GCF. The “Euclidean Algorithm Steps” table shows how the GCF was found, step by step, by reducing the numbers until a remainder of 0 is reached. The bar chart provides a visual comparison.

Key Factors That Affect GCF Results

The Numbers Themselves: The GCF is entirely dependent on the two numbers input. Larger numbers don’t necessarily mean a larger GCF.
Prime Factors: The GCF is the product of the common prime factors of the two numbers, each raised to the lowest power it appears in either factorization. Understanding prime factorization helps understand GCF.
Relative Primality: If two numbers have a GCF of 1, they are called “relatively prime” or “coprime”. For example, GCF(8, 9) = 1.
One Number is a Multiple of the Other: If one number is a multiple of the other, the GCF is the smaller number (e.g., GCF(12, 36) = 12).
Zero Input: Mathematically, GCF(a, 0) = |a|. However, our calculator focuses on positive integers as is common in many GCF applications like fraction simplification. We handle zero by prompting for positive integers.
Magnitude Difference: The number of steps in the Euclidean algorithm can be affected by how close the numbers are and their ratio.

Frequently Asked Questions (FAQ)

What is the GCF of two numbers?: The Greatest Common Factor (GCF) or Greatest Common Divisor (GCD) is the largest positive integer that divides both numbers without leaving a remainder. Our Greatest Common Factor Calculator finds this for you.
How do you find the GCF of 3 numbers?: To find the GCF of three numbers (a, b, c), you can find GCF(a, b) = d, and then find GCF(d, c). The result is the GCF of a, b, and c.
What if one of the numbers is 0?: The GCF(a, 0) is |a| (the absolute value of a), for any non-zero integer a. However, the Greatest Common Factor Calculator above is designed for positive integers, as this is the most common use case (e.g., simplifying fractions).
What if the numbers are negative?: The GCF is usually defined for positive integers. If you have negative numbers, you typically take their absolute values first, so GCF(-a, -b) = GCF(a, b).
What is the difference between GCF and LCM?: The GCF is the largest number that divides into both numbers, while the LCM (Least Common Multiple) is the smallest number that both numbers divide into. For any two positive integers a and b, GCF(a, b) * LCM(a, b) = a * b.
What is the GCF of two prime numbers?: If the two prime numbers are distinct, their GCF is 1. If they are the same prime number, their GCF is that prime number itself.
Can the GCF be larger than the numbers?: No, the GCF of two positive integers is always less than or equal to the smaller of the two integers.
Is there a GCF for just one number?: The concept of GCF is usually applied to two or more numbers. You could say the “GCF” of a single number ‘a’ is |a|, as that’s the largest number that divides it.

Related Tools and Internal Resources

Least Common Multiple Calculator: Find the LCM of two or more numbers.
Prime Factorization Calculator: Break down a number into its prime factors.
Simplify Fractions Calculator: Reduce fractions to their simplest form using the GCF.
Modulo Calculator: Find the remainder of a division, used in the Euclidean Algorithm.
Euclidean Algorithm Explained: Learn more about the method used by this GCF calculator.
Number Theory Calculators: Explore other tools related to number theory.