Show steps for working Out by: no one Listing Multiples prime Factorization Cake / Ladder department Method GCF method  ## Calculator Use

The Least usual Multiple (LCM) is likewise referred to as the Lowest typical Multiple (LCM) and also Least common Divisor (LCD). For 2 integers a and b, denoted LCM(a,b), the LCM is the smallest optimistic integer that is same divisible by both a and b. For example, LCM(2,3) = 6 and LCM(6,10) = 30.

The LCM of two or much more numbers is the the smallest number that is evenly divisible by every numbers in the set.

You are watching: Least common multiple of 3 and 6

## Least usual Multiple Calculator

Find the LCM of a set of numbers v this calculator which additionally shows the steps and how to do the work.

Input the numbers you desire to find the LCM for. You can use commas or spaces to different your numbers. Yet do not use commas within her numbers. For example, enter 2500, 1000 and also not 2,500, 1,000.

See more: What Was The Main Purpose Of The Truman Doctrine Was To, Milestones: 1945

## How to find the Least common Multiple LCM

This LCM calculator with measures finds the LCM and also shows the work using 5 various methods:

Listing Multiples prime Factorization Cake/Ladder Method department Method using the Greatest usual Factor GCF

## How to find LCM by Listing Multiples

list the multiples of each number till at least one of the multiples shows up on all lists discover the the smallest number the is on every one of the lists This number is the LCM

Example: LCM(6,7,21)

Multiples the 6: 6, 12, 18, 24, 30, 36, 42, 48, 54, 60 Multiples the 7: 7, 14, 21, 28, 35, 42, 56, 63 Multiples of 21: 21, 42, 63 find the smallest number the is on all of the lists. We have actually it in bolder above. Therefore LCM(6, 7, 21) is 42

## How to uncover LCM by prime Factorization

discover all the prime factors of each given number. List all the prime numbers found, as plenty of times together they happen most regularly for any one given number. Main point the list of prime factors together to discover the LCM.

The LCM(a,b) is calculated by detect the prime factorization of both a and b. Use the same process for the LCM of much more than 2 numbers.

For example, for LCM(12,30) us find:

element factorization that 12 = 2 × 2 × 3 prime factorization the 30 = 2 × 3 × 5 utilizing all element numbers uncovered as regularly as each occurs most often we take it 2 × 2 × 3 × 5 = 60 thus LCM(12,30) = 60.

For example, for LCM(24,300) we find:

prime factorization the 24 = 2 × 2 × 2 × 3 prime factorization of 300 = 2 × 2 × 3 × 5 × 5 utilizing all element numbers uncovered as regularly as each occurs most often we take it 2 × 2 × 2 × 3 × 5 × 5 = 600 thus LCM(24,300) = 600.

## How to uncover LCM by prime Factorization utilizing Exponents

find all the prime factors of each offered number and also write castle in exponent form. List all the element numbers found, using the greatest exponent discovered for each. Multiply the perform of prime components with exponents with each other to discover the LCM.

Example: LCM(12,18,30)

Prime components of 12 = 2 × 2 × 3 = 22 × 31 Prime components of 18 = 2 × 3 × 3 = 21 × 32 Prime determinants of 30 = 2 × 3 × 5 = 21 × 31 × 51 perform all the prime numbers found, as many times as they occur most often for any one offered number and multiply them together to uncover the LCM 2 × 2 × 3 × 3 × 5 = 180 utilizing exponents instead, multiply together each the the prime numbers through the highest power 22 × 32 × 51 = 180 therefore LCM(12,18,30) = 180

Example: LCM(24,300)

Prime determinants of 24 = 2 × 2 × 2 × 3 = 23 × 31 Prime components of 300 = 2 × 2 × 3 × 5 × 5 = 22 × 31 × 52 perform all the element numbers found, as many times together they occur most often for any type of one offered number and also multiply them together to uncover the LCM 2 × 2 × 2 × 3 × 5 × 5 = 600 making use of exponents instead, multiply with each other each the the prime numbers v the greatest power 23 × 31 × 52 = 600 for this reason LCM(24,300) = 600

## How to find LCM using the Cake technique (Ladder Method)

The cake an approach uses division to find the LCM of a set of numbers. World use the cake or ladder an approach as the fastest and also easiest method to find the LCM because it is straightforward division.

The cake technique is the very same as the ladder method, package method, the factor box technique and the grid method of shortcuts to find the LCM. The boxes and also grids can look a little different, but they every use department by primes to find LCM.