Calculate the greatest common divisor (GCD) and least common multiple (LCM) of two or more numbers.
Greatest common divisor and least common multiple concepts
GCD (Greatest Common Divisor) is the largest positive integer that divides two or more numbers evenly. LCM (Least Common Multiple) is the smallest positive integer that is a multiple of all these numbers. These two concepts are frequently used in mathematics and daily life. Euclidean Algorithm: The most efficient method for calculating GCD. Divide the larger number by the smaller, take the remainder. Replace the smaller number with the remainder. Continue until remainder is 0. The last non-zero remainder is the GCD. This method has been used since 300 BC! Practical applications: Simplifying fractions (numerator and denominator are divided by GCD). Finding common denominators for fraction operations (LCM is used). Equal group division problems (GCD for largest group). Calculating periodic events (when do two events occur simultaneously? LCM). In puzzles and logic problems. GCD and LCM are cornerstones of number theory.
What you need to know about GCD and LCM calculation
GCD (Greatest Common Divisor) is the largest positive integer that divides two or more numbers evenly. It's calculated using the Euclidean Algorithm: Divide the larger by the smaller, take the remainder, replace the smaller with the remainder, and continue until remainder is 0. Example: GCD(48, 18) = 6
Other math calculators you might find useful
Enter the numbers you want to calculate (at least 2 numbers)
You can enter 2-10 integers
GCD (Greatest Common Divisor) is the largest positive integer that divides the numbers. LCM (Least Common Multiple) is the smallest positive integer that is divisible by the numbers.
GCD (Greatest Common Divisor) is the largest positive integer that divides two or more numbers without a remainder. Also known as GCF (Greatest Common Factor) or HCF (Highest Common Factor).
LCM (Least Common Multiple) is the smallest positive integer that is a multiple of two or more numbers. It's the smallest number that all given numbers divide into evenly.
The most efficient method to find the GCD of two numbers. It divides the larger number by the smaller, takes the remainder, and repeats until the remainder is zero.
The product of two numbers equals the product of their GCD and LCM: a × b = GCD(a,b) × LCM(a,b). This property is used to calculate LCM.