LCM (386; 42) = ? Calculate the least common multiple, LCM, by two methods: 1) The prime factorization of the numbers and 2) The Euclidean algorithm

lcm (386; 42) = ?

Method 1. The prime factorization:

The prime factorization of a number: finding the prime numbers that multiply together to make that number.


386 = 2 × 193
386 is not a prime number but a composite one.


42 = 2 × 3 × 7
42 is not a prime number but a composite one.


* The natural numbers that are only divisible by 1 and themselves are called prime numbers. A prime number has exactly two factors: 1 and itself.
* A composite number is a natural number that has at least one other factor than 1 and itself.



Calculate the least common multiple, lcm:

Multiply all the prime factors of the two numbers, taken by the largest exponents (largest powers).


lcm (386; 42) = 2 × 3 × 7 × 193



lcm (386; 42) = 2 × 3 × 7 × 193 = 8,106
The two numbers have common prime factors

Method 2. The Euclidean Algorithm:

Calculate the greatest (highest) common factor (divisor):

This algorithm involves the process of dividing numbers and calculating the remainders.


'a' and 'b' are the two natural numbers, 'a' >= 'b'.


Divide 'a' by 'b' and get the remainder of the operation, 'r'.


If 'r' = 0, STOP. 'b' = the gcf (hcf, gcd) of 'a' and 'b'.


Else: Replace ('a' by 'b') and ('b' by 'r'). Return to the step above.



Step 1. Divide the larger number by the smaller one:
386 ÷ 42 = 9 + 8
Step 2. Divide the smaller number by the above operation's remainder:
42 ÷ 8 = 5 + 2
Step 3. Divide the remainder of the step 1 by the remainder of the step 2:
8 ÷ 2 = 4 + 0
At this step, the remainder is zero, so we stop:
2 is the number we were looking for - the last non-zero remainder.
This is the greatest (highest) common factor (divisor).


The greatest (highest) common factor (divisor):
gcf, hcf, gcd (386; 42) = 2


Calculate the least common multiple:

The least common multiple, Formula:

lcm (a; b) = (a × b) / gcf, hcf, gcd (a; b)


lcm (386; 42) =


(386 × 42) / gcf, hcf, gcd (386; 42) =


16,212 / 2 =


8,106


lcm (386; 42) = 8,106 = 2 × 3 × 7 × 193

The final answer:
The least common multiple
lcm (386; 42) = 8,106 = 2 × 3 × 7 × 193
The two numbers have common prime factors.

Why do we need to calculate the greatest common factor?

Once you've calculated the greatest common factor of the numerator and the denominator of a fraction, it becomes much easier to fully reduce (simplify) the fraction to the lowest terms (the smallest possible numerator and denominator).


By definition, the least common multiple of two numbers is the smallest natural number that is: (1) greater than 0 and (2) a multiple of both numbers.


Other operations of this type:


Calculator: calculate the least common multiple, lcm

Calculate the least common multiple of the numbers, LCM:

Method 1: Run the prime factorization of the numbers - then multiply all the prime factors of the numbers, taken by the largest exponents.

Method 2: The Euclidean algorithm:
lcm (a; b) = (a × b) / gcf (a; b) .

Method 3: The divisibility of the numbers.

The least common multiple, LCM: the latest calculated

The LCM of 386 and 42 = ? May 16 08:25 UTC (GMT)
The LCM of 1,067,089 and 8,536,776 = ? May 16 08:25 UTC (GMT)
The LCM of 176 and 127 = ? May 16 08:25 UTC (GMT)
The LCM of 142,002 and 1,136,080 = ? May 16 08:25 UTC (GMT)
The LCM of 42 and 561 = ? May 16 08:25 UTC (GMT)
The LCM of 9,223 and 55,338 = ? May 16 08:25 UTC (GMT)
The LCM of 60 and 5,774 = ? May 16 08:25 UTC (GMT)
The LCM of 2,168 and 19,512 = ? May 16 08:25 UTC (GMT)
The LCM of 4,516 and 31,661 = ? May 16 08:25 UTC (GMT)
The LCM of 12 and 70 = ? May 16 08:25 UTC (GMT)
The LCM of 78,472 and 470,832 = ? May 16 08:25 UTC (GMT)
The LCM of 3,688 and 33,273 = ? May 16 08:25 UTC (GMT)
The LCM of 39 and 5,170 = ? May 16 08:25 UTC (GMT)
The least common multiple, LCM: the list of all the operations

The least common multiple (lcm). What it is and how to calculate it.


What is a prime number? Definition, examples

What is a composite number? Definition, examples

The prime numbers up to 1,000

The prime numbers up to 10,000

The Sieve of Eratosthenes

The Euclidean Algorithm

Completely reduce (simplify) fractions to the lowest terms: Steps and Examples