How to lcm find

Content on WhatAnswers is provided "as is" for informational purposes. While we strive for accuracy, we make no guarantees. Content is AI-assisted and should not be used as professional advice.

Last updated: April 4, 2026

Quick Answer: To find the Least Common Multiple (LCM) of two or more numbers, you can list multiples of each number until you find the smallest multiple they all share. Alternatively, you can use prime factorization: find the prime factors of each number, then take the highest power of each prime factor present in any of the numbers and multiply them together.

Key Facts

The LCM is the smallest positive integer that is a multiple of two or more given integers.
Listing multiples is a simple method for small numbers.
Prime factorization method is efficient for larger numbers.
The LCM of two numbers a and b can be calculated using the formula: LCM(a, b) = |a * b| / GCD(a, b), where GCD is the Greatest Common Divisor.
The LCM is often used in problems involving fractions, such as finding a common denominator.

What is the Least Common Multiple (LCM)?

The Least Common Multiple (LCM) of two or more integers is the smallest positive integer that is divisible by each of the integers without leaving a remainder. For example, the LCM of 4 and 6 is 12 because 12 is the smallest number that both 4 and 6 divide into evenly. Understanding how to find the LCM is a fundamental concept in arithmetic and number theory, with practical applications in various mathematical problems, especially those involving fractions and periodic events.

Methods for Finding the LCM

Method 1: Listing Multiples

This is the most intuitive method, especially for smaller numbers. To find the LCM of two or more numbers using this method:

List the multiples of the first number.
List the multiples of the second number.
Continue listing multiples for all given numbers.
Identify the smallest number that appears in all the lists. This is the LCM.

Example: Find the LCM of 4 and 6.

Multiples of 4: 4, 8, 12, 16, 20, 24, ...
Multiples of 6: 6, 12, 18, 24, 30, ...

The smallest number that appears in both lists is 12. Therefore, the LCM of 4 and 6 is 12.

Example: Find the LCM of 3, 5, and 10.

Multiples of 3: 3, 6, 9, 12, 15, 18, 21, 24, 27, 30, 33, ...
Multiples of 5: 5, 10, 15, 20, 25, 30, 35, ...
Multiples of 10: 10, 20, 30, 40, ...

The smallest number that appears in all three lists is 30. Therefore, the LCM of 3, 5, and 10 is 30.

Method 2: Prime Factorization

This method is more systematic and efficient, especially for larger numbers or when finding the LCM of more than two numbers.

Find the prime factorization of each number. This means expressing each number as a product of its prime factors.
Identify all the unique prime factors that appear in any of the factorizations.
For each unique prime factor, take the highest power that appears in any of the factorizations.
Multiply these highest powers together. The result is the LCM.

Example: Find the LCM of 12 and 18.

Prime factorization of 12: 2 × 2 × 3 = 2² × 3¹
Prime factorization of 18: 2 × 3 × 3 = 2¹ × 3²

The unique prime factors are 2 and 3.

The highest power of 2 is 2² (from the factorization of 12).

The highest power of 3 is 3² (from the factorization of 18).

LCM(12, 18) = 2² × 3² = 4 × 9 = 36.

Example: Find the LCM of 8, 9, and 10.

Prime factorization of 8: 2 × 2 × 2 = 2³
Prime factorization of 9: 3 × 3 = 3²
Prime factorization of 10: 2 × 5 = 2¹ × 5¹

The unique prime factors are 2, 3, and 5.

The highest power of 2 is 2³ (from 8).

The highest power of 3 is 3² (from 9).

The highest power of 5 is 5¹ (from 10).

LCM(8, 9, 10) = 2³ × 3² × 5¹ = 8 × 9 × 5 = 72 × 5 = 360.

Method 3: Using the Greatest Common Divisor (GCD)

For finding the LCM of *two* numbers, there's a useful formula that involves their Greatest Common Divisor (GCD). The GCD of two numbers is the largest positive integer that divides both numbers without leaving a remainder.

The formula is: LCM(a, b) = (|a × b|) / GCD(a, b)

First, you need to find the GCD of the two numbers. The Euclidean algorithm is a common and efficient way to find the GCD.

Example: Find the LCM of 12 and 18 using GCD.

First, find GCD(12, 18):

Using Euclidean Algorithm:

18 = 1 × 12 + 6
12 = 2 × 6 + 0

The last non-zero remainder is 6. So, GCD(12, 18) = 6.

Now, apply the formula:

LCM(12, 18) = (12 × 18) / 6 = 216 / 6 = 36.

This method is particularly efficient if you already know how to find the GCD.

Why is Finding the LCM Important?

The LCM has several practical applications:

Adding and Subtracting Fractions: The LCM of the denominators is used to find a common denominator, which is essential for performing addition and subtraction operations on fractions with different denominators. For instance, to add 1/4 and 1/6, you find the LCM of 4 and 6, which is 12. You then rewrite the fractions as 3/12 and 2/12, allowing you to add them: 3/12 + 2/12 = 5/12.
Scheduling and Periodic Events: If two events occur at regular intervals, the LCM can help determine when they will occur simultaneously. For example, if one bus arrives every 15 minutes and another every 20 minutes, the LCM of 15 and 20 (which is 60) tells you they will both arrive at the station together every 60 minutes.
Number Theory Problems: The LCM is a key concept in various number theory problems and algebraic manipulations.

Choosing the right method depends on the size of the numbers and your familiarity with prime factorization or the GCD. For most everyday calculations, listing multiples or the prime factorization method are sufficient.