Added to Favorites

Related Searches

Nearby Words

In arithmetic and number theory, the least common multiple or lowest common multiple (lcm) or smallest common multiple of two integers a and b is the smallest positive integer that is a multiple of both a and b. Since it is a multiple, it can be divided by a and b without a remainder. If there is no such positive integer, e.g., if a = 0 or b = 0, then lcm(a, b) is defined to be zero.)## Example

## Use in adding, subtracting, and comparing fractions

When adding or subtracting vulgar fractions, it is useful to find the least common multiple of the denominators, often called the lowest common denominator. For instance, # {21cdot 6over 3}={126over 3}

42.## Finding least common multiples by prime factorization

### Viewing this method via Venn diagrams

## A third method

## The lcm in commutative rings

The least common multiple can be defined generally over commutative rings as follows: Let a and b be elements of a commutative ring R. A common multiple of a and b is an element m of R such that both a and b divide m (i.e. there exist elements x and y of R such that ax = m and by = m). A least common multiple of a and b is a common multiple that is minimal in the sense that for any other common multiple n of a and b, m divides n.## See also

## External links

## References

The definition is sometimes generalized for more than two integers: The lowest common multiple of integers a_{1} ... a_{n} is the smallest positive integer that is a multiple of a_{1} ... a_{n}.

Multiples of 4 are:

- 4, 8, 12, 16, 20, 24, 28, 32, 36, 40, 44, 48, 52, ...

(add 4 to each to get the next).

Multiples of 6 are:

- 6, 12, 18, 24, 30, 36, 42, 48, 54, ...

(add 6 to each to get the next).

Common multiples of 4 and 6 are numbers that these two lists share in common:

- 12, 24, 36, 48, ....

The smallest common multiple of 4 and 6 is therefore 12.

- $\{2over21\}+\{1over6\}=\{4over42\}+\{7over42\}=\{11over42\},$

where the denominator 42 was used because it is the least common multiple of 6 and 21.

- $operatorname\{lcm\}(a,b)=frac\{acdot\; b\}\{operatorname\{gcd\}(a,b)\}.$

Thus, the Euclidean algorithm for the gcd also gives us a fast algorithm for the lcm. To return to the example above,

- $operatorname\{lcm\}(21,6)$

Because (ab)/c = a(b/c) = (a/c)b, one can calculate the lcm using the above formula more efficiently, by first exploiting the fact that b/c or a/c will be easier to calculate than the quotient of the product ab and c, because the fact that c is a factor of both a and b entails that in either fraction, a/c or b/c, one can completely cancel the c. This can be true whether the calculations are performed by a human, or a computer, which may have storage requirements on the variables a, b, c, where the limits may be 4-byte storage - calculating ab may cause an overflow, if storage space is not allocated properly.

Using this, we can then calculate the lcm by either using:

- $operatorname\{lcm\}(a,b)=left(\{aoveroperatorname\{gcd\}(a,b)\}right)cdot\; b$

or

- $operatorname\{lcm\}(a,b)=left(\{boveroperatorname\{gcd\}(a,b)\}right)cdot\; a$

Done this way, the previous example becomes:

- $operatorname\{lcm\}(21,6)=\{21overoperatorname\{gcd\}(21,6)\}cdot6=\{21over3\}cdot6=7cdot6=42.$

Even if the numbers are large and not quickly factorable, the gcd can be calculated quickly with Euclid's algorithm.

The unique factorization theorem says that every positive integer number greater than 1 can be written in only one way as a product of prime numbers. The prime numbers can be considered as the atomic elements which, when combined together, make up a composite number.

For example:

- $90\; =\; 2^1\; cdot\; 3^2\; cdot\; 5^1\; =\; 2\; cdot\; 9\; cdot\; 5.\; ,!$

Here we have the composite number 90 made up of one atom of the prime number 2, two atoms of the prime number 3 and one atom of the prime number 5.

This knowledge can be used to find the lcm of a set of numbers.

Example: Find the value of lcm(8,9,21).

First, factor out each number and express it as a product of prime number powers.

- $8;\; ,\; ;\; ,=\; 2^3\; cdot\; 3^0\; cdot\; 5^0\; cdot\; 7^0\; ,!$

- $9;\; ,\; ;\; ,=\; 2^0\; cdot\; 3^2\; cdot\; 5^0\; cdot\; 7^0\; ,!$

- $21;\; ,=\; 2^0\; cdot\; 3^1\; cdot\; 5^0\; cdot\; 7^1.\; ,!$

The lcm will be the product of multiplying the highest power in each prime factor category together. Out of the 4 prime factor categories 2, 3, 5, and 7, the highest powers from each are 2^{3}, 3^{2}, 5^{0}, and 7^{1}. Thus,

- $operatorname\{lcm\}(8,9,21)\; =\; 2^3\; cdot\; 3^2\; cdot\; 5^0\; cdot\; 7^1\; =\; 8\; cdot\; 9\; cdot\; 1\; cdot\; 7\; =\; 504.\; ,!$

One can find the least common multiple of two numbers by using a Venn diagram as follows. Find the prime factorization of each of the two numbers. Put the prime factors into a Venn diagram with one circle for each of the two numbers, and all factors they share in common in the intersection. To find the LCM, just multiply all of the prime numbers in the diagram.

Here is an example:

- 48 = 2 × 2 × 2 × 2 × 3,

- 180 = 2 × 2 × 3 × 3 × 5,

and what they share in common is two "2"s and a "3":

- Least common multiple = 2 × 2 × 2 × 2 × 3 × 3 × 5 = 720

- Greatest common divisor = 2 × 2 × 3 = 12

This also works for the greatest common divisor (GCD), except that instead of multiplying all of the numbers in the Venn diagram, one multiplies only the prime factors that are in the intersection. Thus the GCD of 48 and 180 is 2 × 2 × 3 = 12.

This method works as easily for finding the LCM of several integers.

Let there be a finite sequence of positive integers X = (x_{1}, x_{2}, ..., x_{n}), n > 1. The algorithm proceeds in steps as follows: on each step m it examines and updates the sequence X^{(m)} = (x_{1}^{(m)}, x_{2}^{(m)}, ..., x_{n}^{(m)}), X^{(1)} = X. The purpose of the examination is to pick up the least (perhaps, one of many) element of the sequence X^{(m)}. Assuming x_{k}0^{(m)} is the selected element, the sequence X^{(m+1)} is defined as

- x
_{k}^{(m+1)}= x_{k}^{(m)}, k ≠ k_{0}

- x
_{k}0^{(m+1)}= x_{k}0^{(m)}+ x_{k}0.

In other words, the least element is increased by the corresponding x whereas the rest of the elements pass from X^{(m)} to X^{(m+1)} unchanged.

The algorithm stops when all elements in sequence X^{(m)} are equal. Their common value L is exactly LCM(X). (For a proof and an interactive simulation see reference below, Algorithm for Computing the LCM.)

In general, two elements in a commutative ring can have no least common multiple or more than one. However, any two least common multiples of the same pair of elements are associates. In a unique factorization domain, any two elements have a least common multiple. In a principal ideal domain, the least common multiple of a and b can be characterised as a generator of the intersection of the ideals generated by a and b (the intersection of a collection of ideals is always an ideal). In principal ideal domains, one can even talk about the least common multiple of arbitrary collections of elements: it is a generator of the intersection of the ideals generated by the elements of the collection.

- Math
- Online LCM calculator
- Online lcm calculator
- Online LCM calculator
- LCM Quiz
- Algorithm for Computing the LCM

Wikipedia, the free encyclopedia © 2001-2006 Wikipedia contributors (Disclaimer)

This article is licensed under the GNU Free Documentation License.

Last updated on Saturday October 11, 2008 at 06:42:47 PDT (GMT -0700)

View this article at Wikipedia.org - Edit this article at Wikipedia.org - Donate to the Wikimedia Foundation

This article is licensed under the GNU Free Documentation License.

Last updated on Saturday October 11, 2008 at 06:42:47 PDT (GMT -0700)

View this article at Wikipedia.org - Edit this article at Wikipedia.org - Donate to the Wikimedia Foundation

Copyright © 2014 Dictionary.com, LLC. All rights reserved.