GCF Calculator - Greatest Common Factor Calculator with Steps

Enter Numbers

Enter 2-10 positive integers

GCF Results

Enter numbers and click Calculate

GCF & LCM Reference

What is GCF?

The Greatest Common Factor (GCF), also called Greatest Common Divisor (GCD), is the largest positive integer that divides all given numbers evenly.

Example: GCF(12, 18) = 6

Common Applications

  • • Simplifying fractions (divide by GCF)
  • • Dividing objects into equal groups
  • • Finding largest tile size for floors
  • • Reducing ratios to simplest form

GCF Properties

  • • GCF(a,b) ≤ min(a,b)
  • • GCF(a,0) = a
  • • If a divides b, then GCF(a,b) = a
  • • GCF(a,b) × LCM(a,b) = a × b

Special Cases

  • Coprime: GCF = 1 (no common factors)
  • One divides other: GCF = smaller number
  • Identical numbers: GCF = the number itself
  • Consecutive numbers: GCF = 1

About GCF Calculator

Our GCF Calculator is a free, comprehensive online tool designed to find the Greatest Common Factor (also known as GCD - Greatest Common Divisor or HCF - Highest Common Factor) of 2 to 10 positive integers instantly. Whether you're simplifying fractions, solving division problems, or learning number theory, our calculator provides accurate results with detailed explanations, Euclidean algorithm visualization, and step-by-step solutions.

Understanding GCF: The Basics

What is GCF?

The Greatest Common Factor (GCF) is the largest positive integer that divides all given numbers evenly without leaving a remainder. It represents the biggest "building block" that all the numbers share.

Example

Find GCF(12, 18):

  • Factors of 12: 1, 2, 3, 4, 6, 12
  • Factors of 18: 1, 2, 3, 6, 9, 18
  • Common factors: 1, 2, 3, 6
  • GCF(12, 18) = 6 (the largest common factor)

Key Properties of GCF

  • Always ≤ smallest input: GCF(a,b) ≤ min(a,b)
  • Divides all inputs: Every input number is divisible by the GCF
  • Uniqueness: There is only one GCF for any set of numbers
  • With 1: GCF(a, 1) = 1 for any positive integer a
  • With self: GCF(a, a) = a

Methods to Calculate GCF

Method 1: Euclidean Algorithm

The Euclidean Algorithm is the most efficient method for finding GCF of two numbers. It uses repeated division to find the greatest common divisor.

Example: GCF(48, 18)

Step 1: 48 = 18 × 2 + 12

Step 2: 18 = 12 × 1 + 6

Step 3: 12 = 6 × 2 + 0

GCF = 6 (last non-zero remainder)

Method 2: Prime Factorization

Break each number into prime factors, then multiply the common primes with their lowest powers.

Example: GCF(24, 36)

24 = 2³ × 3¹

36 = 2² × 3²

Take lowest powers of common primes:

GCF = 2² × 3¹ = 4 × 3 = 12

GCF(24, 36) = 12

Method 3: Listing Factors

List all factors of each number and identify the greatest common one. Best for small numbers.

GCF and LCM Relationship

For any two positive integers a and b:

GCF(a,b) × LCM(a,b) = a × b

This relationship helps verify calculations and find one value from the other

Practical Applications of GCF

1. Simplifying Fractions

The most common use of GCF is simplifying fractions by dividing both numerator and denominator by their GCF.

Example: Simplify 18/24

Step 1: Find GCF(18, 24) = 6

Step 2: Divide both by 6

18 ÷ 6 = 3

24 ÷ 6 = 4

Result: 18/24 = 3/4

2. Equal Distribution

GCF helps divide items into equal groups. Example: Distribute 24 apples and 36 oranges equally among students—GCF(24,36)=12, so maximum 12 students.

3. Tile and Layout Problems

Find the largest square tile that fits perfectly. Example: For a 24×36 inch space, GCF=12, use 12×12 inch tiles.

Related Calculators

Additional Resources

For more information about GCF and number theory: