GCF tiles a rectangle
The greatest common factor is the side length of the largest square that perfectly tiles a rectangle with your two numbers as side lengths—no scraps left over.
LCM is reported as non-negative. If any input exceeds 9,007,199,254,740,991 (253−1), the calculator switches to BigInt mode automatically.
Need to find the lowest common multiple or the greatest common factor quickly? This calculator makes it easy to compare numbers, simplify fractions, and plan repeating patterns without doing long arithmetic by hand. Enter a list of integers and get the LCM, GCF (also called GCD or HCF), and clear explanations you can rely on.
What these results mean: the LCM (least common multiple) is the smallest positive number that all your inputs divide into evenly. It tells you when cycles line up, like schedules or repeating events. The GCF (greatest common factor) is the largest number that divides all inputs without a remainder. It is the key idea behind reducing fractions and comparing ratios.
Behind the scenes, the calculator uses the Euclidean Algorithm, a fast and reliable way to find the GCF by repeatedly dividing and taking remainders. Once the GCF is known, the LCM is found using the relationship \( \mathrm{LCM}(a,b)=\dfrac{|a\cdot b|}{\gcd(a,b)} \). For lists of numbers, the calculator combines them step by step until all values are included.
How to use the calculator:
Real-world uses: LCM helps when you need a shared timeline, such as syncing class schedules, maintenance cycles, or music loops. GCF is useful for simplifying ingredient ratios, resizing images evenly, or reducing fractions in math homework. If you are working with multiple measurements or repeating intervals, these values provide quick answers and help you avoid mistakes.
Special cases handled: zeros are allowed (if any input is zero, the LCM is zero), negatives are treated by absolute value, and large integers switch to precise BigInt arithmetic so results stay accurate.
Commas, spaces, or new lines. Extra whitespace is ignored.
Yes. We use absolute values for GCF/LCM. Zeros are allowed; if any number is zero, the LCM of the list is zero.
Then GCF = |n| and LCM = |n|.
Everything runs in your browser; nothing is uploaded.
The greatest common factor is the side length of the largest square that perfectly tiles a rectangle with your two numbers as side lengths—no scraps left over.
Bus every 12 minutes and train every 18? They line up every 36 minutes—that’s the LCM at work. Any repeating schedules reunite at their least common multiple.
For any two non-zero integers, gcd(a,b) × lcm(a,b) = |a·b|. If your results break that identity, something went wrong.
GCF grabs the overlap of prime factors; LCM grabs the union. They’re two sides of the same prime “fingerprint” of your numbers.
Euclid’s algorithm for GCF is 2,300+ years old and still near-optimal. The subtraction-only version even works on paper without division.