Greatest Common Factor and Least Common Multiple Calculator
GCF & LCM
GCF: 6 · LCM: 36
Your Recent & Past Results
Restored a past calculation.
Advertisement
Compare Calculations
Side-by-Side Comparison
A comparison of your scenarios' results
Downloads
Includes your inputs and results for this calculation, plus any additional calculations you've compared.
Share & Print
The link includes your inputs and results, so anyone who opens it sees this exact calculation.
How This Calculator Works
The Greatest Common Factor (GCF, also called GCD) of a set of numbers is the largest number that
divides evenly into all of them, and the Least Common Multiple (LCM) is the smallest number that
all of them divide evenly into. Enter two or more whole numbers, and this calculator finds both
instantly.
The Method
GCF is found using the Euclidean algorithm — a method dating back over 2,000 years: repeatedly
divide the larger number by the smaller and replace the larger with the remainder, until the
remainder reaches zero. The last non-zero value is the GCF.
Once the GCF is known, the LCM of two numbers follows directly:
LCM(a,b)=GCF(a,b)a×b
For more than two numbers, this calculator applies both methods pairwise across the whole list.
Worked Example
Finding the GCF and LCM of 12 and 18:
Euclidean algorithm: 18 ÷ 12 leaves a remainder of 6; 12 ÷ 6 leaves a remainder of 0. The GCF is
6.
LCM(12,18)=(12×18)÷6=216÷6=36.
Cómo funciona esta calculadora
El Máximo Común Divisor (MCD, también llamado GCF/GCD en inglés) de un conjunto de números es el
número más grande que divide de forma exacta a todos ellos, y el Mínimo Común Múltiplo (MCM) es el
número más pequeño que es divisible de forma exacta por todos ellos. Ingresa dos o más números
enteros, y esta calculadora encuentra ambos al instante.
El método
El MCD se encuentra usando el algoritmo de Euclides — un método que se remonta a hace más de 2,000
años: se divide repetidamente el número mayor entre el menor y se reemplaza el mayor por el
residuo, hasta que el residuo llega a cero. El último valor distinto de cero es el MCD.
Una vez que se conoce el MCD, el MCM de dos números se obtiene directamente:
MCM(a,b)=MCD(a,b)a×b
Para más de dos números, esta calculadora aplica ambos métodos por pares a lo largo de toda la
lista.
Ejemplo resuelto
Encontrando el MCD y el MCM de 12 y 18:
Algoritmo de Euclides: 18 ÷ 12 deja un residuo de 6; 12 ÷ 6 deja un residuo de 0. El MCD es
6.
GCF (Greatest Common Factor, also called GCD) is the largest number that divides evenly into every number in the list. LCM (Least Common Multiple) is the smallest number that every number in the list divides evenly into. GCF is always less than or equal to the smallest input; LCM is always greater than or equal to the largest.
What is GCF/LCM used for?
GCF is commonly used to simplify fractions (dividing both the numerator and denominator by their GCF gives the simplest form). LCM is used to find a common denominator when adding or subtracting fractions with different denominators, and in scheduling problems (e.g. "these two events repeat every 4 and 6 days — when do they next coincide?").
Can I find the GCF/LCM of more than two numbers?
Yes — enter as many whole numbers as you like, separated by commas, spaces, or new lines. This calculator finds the GCF and LCM across the entire list, not just pairs.
We use cookies for analytics and ads to help support this free site. You can accept all, or decline and we'll only use what's needed for the site to work.