Greatest Common Divisor & Least Common Multiple Calculator

First Number: Second Number:
Third Number (not required):



Greatest Common Factor (GCF):
Least Common Multiplier (LCM):

Greatest Common Divisor & Least Common Multiple Calculator: With this calculator, you can easily find the Greatest Common Divisor and Least Common Multiple for two or three numbers in a swift manner.

What is the Least Common Multiple LCM?

The Least Common Multiple (LCM) is the smallest positive integer that is divisible by two or more given numbers without leaving a remainder. In other words, it is the smallest common multiple of those numbers.

To find the LCM of two or more numbers, you can use various methods, including prime factorization, listing multiples, or using the LCM formula. The LCM is useful in various mathematical operations, such as adding or subtracting fractions with different denominators, solving equations, and finding patterns in numbers.

For example, to find the LCM of 4 and 6:

  • List the multiples of each number: 4, 8, 12, 16, 20, ... 6, 12, 18, 24, ...
  • Identify the smallest number that appears in both lists, which is 12. Therefore, the LCM of 4 and 6 is 12.

The LCM can also be calculated using prime factorization. By expressing each number as a product of prime factors, you can determine the LCM by taking the highest power of each prime factor present in the numbers.

It's important to note that the LCM is unique for any given set of numbers, and it provides a useful tool in various mathematical calculations and problem-solving scenarios.

How to find the least common multiple LCM?

To find the Least Common Multiple (LCM) of two or more numbers, you can use various methods, including prime factorization, listing multiples, or using the LCM formula. Here, we'll explain the prime factorization and listing multiples methods:

  1. Prime Factorization Method:

    • Express each number as a product of its prime factors.
    • Identify all the unique prime factors among the numbers and write down the highest exponent for each prime factor.
    • Multiply all the prime factors with their respective exponents to obtain the LCM.

    For example, let's find the LCM of 12 and 18:

    • Prime factorization of 12: 2^2 * 3^1
    • Prime factorization of 18: 2^1 * 3^2
    • Unique prime factors: 2 (highest exponent: 2) and 3 (highest exponent: 2)
    • LCM = 2^2 * 3^2 = 36

  2. Listing Multiples Method:

    • List the multiples of each number until you find a common multiple.
    • Identify the smallest common multiple among the lists.

    For example, let's find the LCM of 4 and 6:

    • Multiples of 4: 4, 8, 12, 16, 20, 24, 28, 32, 36, ...
    • Multiples of 6: 6, 12, 18, 24, 30, 36, ...
    • The smallest common multiple is 12, which is the LCM.

Both methods will yield the same LCM for any given set of numbers. The choice of method depends on the numbers involved and personal preference. LCM calculations can also be performed using online LCM calculators or built-in functions in mathematical software.

What is the Greatest Common Divisor GCD?

The Greatest Common Divisor (GCD), also known as the Greatest Common Factor (GCF) or Highest Common Factor (HCF), is the largest positive integer that divides evenly into two or more given numbers. In other words, it is the largest number that is a common factor of the given numbers.

To find the GCD of two or more numbers, you can use various methods, including prime factorization, the Euclidean algorithm, or using a GCD calculator. The GCD is useful in simplifying fractions, solving equations, and finding common denominators.

For example, let's find the GCD of 24 and 36:

  • Prime factorization of 24: 2^3 * 3^1
  • Prime factorization of 36: 2^2 * 3^2
  • Common prime factors: 2 (minimum exponent: 2) and 3 (minimum exponent: 1)
  • GCD = 2^2 * 3^1 = 12

The GCD can also be found using the Euclidean algorithm, which involves dividing the larger number by the smaller number and repeating the process until a remainder of zero is obtained. The divisor at the last step is the GCD.

It's important to note that the GCD is always a positive integer and that the GCD of any number with zero is the number itself.

The GCD provides a useful tool in various mathematical calculations and problem-solving scenarios.

How to find the greatest common divisor GCD?

To find the Greatest Common Divisor (GCD) of two or more numbers, you can use several methods, including the prime factorization method, the Euclidean algorithm, or using a GCD calculator. Here, we'll explain the prime factorization and Euclidean algorithm methods:

  1. Prime Factorization Method:

    • Express each number as a product of its prime factors.
    • Identify the common prime factors among the numbers and write down the smallest exponent for each common factor.
    • Multiply all the common factors with their respective exponents to obtain the GCD.

    For example, let's find the GCD of 24 and 36:

    • Prime factorization of 24: 2^3 * 3^1
    • Prime factorization of 36: 2^2 * 3^2
    • Common prime factors: 2 (minimum exponent: 2) and 3 (minimum exponent: 1)
    • GCD = 2^2 * 3^1 = 12

  2. Euclidean Algorithm:

    • Take the two numbers for which you want to find the GCD.
    • Divide the larger number by the smaller number.
    • If the remainder is zero, the smaller number is the GCD.
    • If the remainder is not zero, replace the larger number with the remainder, and repeat the process.
    • Continue dividing until you reach a remainder of zero.
    • The divisor at this step is the GCD.

    For example, let's find the GCD of 24 and 36 using the Euclidean algorithm:

    • Divide 36 by 24: 36 ÷ 24 = 1 with a remainder of 12
    • Divide 24 by 12: 24 ÷ 12 = 2 with a remainder of 0
    • The divisor at the last step is 12, which is the GCD.

Both methods will yield the same GCD for any given set of numbers. The choice of method depends on the numbers involved and personal preference. GCD calculations can also be performed using online GCD calculators or built-in functions in mathematical software.

MATH CALCULATORS