The GCF (Greatest Common Factor) is the largest number that divides two or more whole numbers with no remainder; in computer science and higher mathematics it's usually called the GCD (Greatest Common Divisor) — the two terms mean exactly the same thing. The LCM (Least Common Multiple) is the smallest positive number that all of those numbers divide into evenly. The calculator above solves both, with four independent methods so you can see how each one reaches the same answer.
How do you find the GCF? (prime factorization method)
- Prime factorization method: multiply the common primes using their lowest powers.
- Division ladder method: write the primes that divide all the numbers at once down the left side; their product is the GCF.
- Listing multiples method: write out each number's multiples until one appears in every list — that's the LCM.
- Euclidean algorithm: divide the larger number by the smaller one and repeat with the remainder until it hits zero; the last divisor is the GCF (fastest for large numbers).