Greatest Common Factor Calculator - GCF Calculator & GCD Calculator
Free greatest common factor calculator. Find GCF (GCD) using Euclidean algorithm, prime factorization, and listing factors. Calculate LCM, all factors, and get step-by-step solutions.
Last updated: December 15, 2024
Need a custom math calculator for your platform? Get a Quote
Enter comma-separated positive integers
GCF Results
GCF (Greatest Common Factor):
12
LCM (Least Common Multiple):
144
Prime Factorizations:
24 = 2 × 2 × 2 × 3
36 = 2 × 2 × 3 × 3
48 = 2 × 2 × 2 × 2 × 3
All Factors:
24: 1, 2, 3, 4, 6, 8, 12, 24
36: 1, 2, 3, 4, 6, 9, 12, 18, 36
48: 1, 2, 3, 4, 6, 8, 12, 16, 24, 48
Step-by-Step Solution:
1. Given numbers: 24, 36, 48
2. Calculate GCF using Euclidean algorithm
3. GCD(24, 36): 24 = 36 × 0 + 24
4. GCD(36, 24): 36 = 24 × 1 + 12
5. GCD(24, 12): 24 = 12 × 2 + 0
6. GCD(24, 36) = 12
7. Continue calculating GCF for remaining numbers
8. Greatest Common Factor (GCF) = 12
9. Calculate LCM: Least Common Multiple = 144
10. Prime factorizations calculated for all numbers
GCF Tips:
- • GCF is the largest number that divides all given numbers
- • Also called GCD (Greatest Common Divisor) or HCF
- • Calculated using the Euclidean algorithm
- • LCM × GCF = Product of two numbers (for 2 numbers)
- • Used for simplifying fractions and ratios
Greatest Common Factor Calculator Methods
Method
Multiple
Uses Euclidean algorithm for efficiency
Alternative Name
Same as GCF
GCD and GCF are identical concepts
Process
Factor & Multiply
Shows prime factorization of each number
Efficiency
Very Fast
Best for large numbers
Relationship
LCM × GCF
Shows mathematical relationship between them
Terminology
British Term
HCF is another name for GCF
Quick Example Result
Find GCF of 24, 36, and 48:
GCF
12
LCM
144
Method
Euclidean
How Our Greatest Common Factor Calculator Works
Our GCF calculator uses the Euclidean algorithm, one of the oldest and most efficient algorithms in mathematics. It repeatedly applies the division algorithm to find the greatest common divisor, then displays prime factorizations, all factors, and calculates the LCM as well.
Euclidean Algorithm for GCF
GCD(a, b):
1. If b = 0, return a
2. Otherwise, return GCD(b, a mod b)
Repeat until b = 0
The Euclidean algorithm is remarkably efficient, taking O(log min(a,b)) steps. It works by repeatedly replacing the larger number with the remainder of dividing it by the smaller number, until the remainder is 0.
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)
Showing Euclidean algorithm steps and prime factorization
Mathematical Foundation
The greatest common factor is fundamental to number theory and has been studied since ancient times. Euclid's algorithm (circa 300 BCE) remains the most efficient method for computing GCF. The algorithm is based on the principle that GCD(a, b) = GCD(b, a mod b), which follows from the division algorithm and properties of divisibility.
- GCF is always ≤ the smallest number in the set
- For two numbers: GCF × LCM = product of the numbers
- GCF(a, 0) = a for any positive integer a
- If GCF(a, b) = 1, numbers are coprime (relatively prime)
- GCF is associative: GCF(a, b, c) = GCF(GCF(a, b), c)
- Used extensively in fraction simplification and modular arithmetic
Sources & References
- Introduction to Number Theory - Niven, Zuckerman, Montgomery (5th Edition)Standard reference for GCD and number theory
- The Art of Computer Programming, Vol. 2 - Donald KnuthComprehensive coverage of GCD algorithms
- Khan Academy - Factors and MultiplesEducational resource for learning GCF and LCM
Need help with other number theory calculations? Check out our LCM calculator and prime factorization calculator.
Get Custom Calculator for Your PlatformGCF Calculation Examples
Given Numbers:
- Numbers: 24, 36, 48
- 24: 2³ × 3
- 36: 2² × 3²
- 48: 2⁴ × 3
Solution Steps:
- Find GCD(24, 36) = 12
- Find GCD(12, 48) = 12
- Common primes: 2² × 3
- GCF = 12
Results:
GCF: 12
LCM: 144
Common Factors: 1, 2, 3, 4, 6, 12
Verification: 12 divides all
Coprime Example
GCF(15, 28)
GCF = 1 (no common factors)
Prime Example
GCF(7, 13, 17)
GCF = 1 (all prime)
Frequently Asked Questions
Found This Calculator Helpful?
Share it with others who need help finding GCF