## Calculator Use

The Least typical Multiple (LCM) is additionally referred to together the Lowest common Multiple (LCM) and also Least usual Divisor (LCD). For two integers a and also b, denoted LCM(a,b), the LCM is the smallest hopeful integer that is evenly divisible by both a and also b. Because that example, LCM(2,3) = 6 and also LCM(6,10) = 30.

The LCM of 2 or much more numbers is the smallest number the is evenly divisible by all numbers in the set.

You are watching: Least common multiple of 3 and 4

## Least usual Multiple Calculator

Find the LCM the a collection of numbers through this calculator which additionally shows the steps and also how to execute the work.

Input the numbers you want to uncover the LCM for. You can use commas or spaces to separate your numbers. But do not use commas within her numbers. For example, enter **2500, 1000** and also not **2,500, 1,000**.

See more: Wire Size For 100 Amp Sub Panel 200 Feet Away, Questions 11

## How to discover the Least common Multiple LCM

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

Listing Multiples prime Factorization Cake/Ladder Method department Method using the Greatest typical Factor GCF## How to find LCM through Listing Multiples

perform the multiples of each number until at least one that the multiples appears on every lists find the smallest number the is on every one of the list This number is the LCMExample: LCM(6,7,21)

Multiples that 6: 6, 12, 18, 24, 30, 36,**42**, 48, 54, 60 Multiples that 7: 7, 14, 21, 28, 35,

**42**, 56, 63 Multiples the 21: 21,

**42**, 63 uncover the smallest number the is on all of the lists. We have it in interlocutor above. Therefore LCM(6, 7, 21) is 42

## How to uncover LCM by prime Factorization

discover all the prime factors of each offered number. List all the element numbers found, as plenty of times as they occur most frequently for any type of one provided number. Multiply the list of prime factors together to find the LCM.The LCM(a,b) is calculation by detect the prime factorization the both a and b. Use the same procedure for the LCM of an ext than 2 numbers.

**For example, because that LCM(12,30) us find:**

**For example, because that LCM(24,300) us find:**

## How to discover LCM by prime Factorization utilizing Exponents

discover all the prime factors of each provided number and write castle in exponent form. List all the prime numbers found, utilizing the greatest exponent uncovered for each. Multiply the list of prime determinants with exponents with each other to uncover the LCM.Example: LCM(12,18,30)

Prime components of 12 = 2 × 2 × 3 = 22 × 31 Prime determinants of 18 = 2 × 3 × 3 = 21 × 32 Prime components of 30 = 2 × 3 × 5 = 21 × 31 × 51 list all the prime numbers found, as countless times as they occur most regularly for any one given number and multiply them together to uncover the LCM 2 × 2 × 3 × 3 × 5 = 180 using exponents instead, multiply together each the the element numbers v the highest power 22 × 32 × 51 = 180 so LCM(12,18,30) = 180Example: LCM(24,300)

Prime components of 24 = 2 × 2 × 2 × 3 = 23 × 31 Prime factors of 300 = 2 × 2 × 3 × 5 × 5 = 22 × 31 × 52 list all the element numbers found, as plenty of times together they occur most regularly for any type of one given number and also multiply them with each other to find the LCM 2 × 2 × 2 × 3 × 5 × 5 = 600 making use of exponents instead, multiply with each other each the the element numbers with the highest possible power 23 × 31 × 52 = 600 so LCM(24,300) = 600## How to uncover LCM using the Cake method (Ladder Method)

The cake technique uses division to uncover the LCM of a set of numbers. Civilization use the cake or ladder method as the fastest and also easiest method to discover the LCM due to the fact that it is simple division.

The cake method is the same as the ladder method, package method, the aspect box technique and the grid technique of shortcuts to discover the LCM. The boxes and also grids can look a small different, however they every use division by primes to uncover LCM.