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.
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.
Read more about this topic: Least Common Multiple
Famous quotes containing the word rings:
“It is told that some divorcees, elated by their freedom, pause on leaving the courthouse to kiss a front pillar, or even walk to the Truckee to hurl their wedding rings into the river; but boys who recover the rings declare they are of the dime-store variety, and accuse the throwers of fraudulent practices.”
—Administration in the State of Neva, U.S. public relief program. Nevada: A Guide to the Silver State (The WPA Guide to Nevada)