Difference between revisions of "Common multiple"
(→See Also) |
I like pie (talk | contribs) m |
||
(One intermediate revision by the same user not shown) | |||
Line 6: | Line 6: | ||
== See Also == | == See Also == | ||
− | + | * [[Common divisor]] | |
− | [[ | ||
[[Category:Definition]] | [[Category:Definition]] |
Latest revision as of 10:15, 19 April 2008
The common multiple of two or more positive integers is a multiple common to those numbers. Any finite set of positive integers have an infinite number of common multiples.
Every common multiple of a set of integers is a multiple of the least common multiple of those integers.
For example, the least common multiple of 6, 10 and 15 is 30, and the common multiples of 6, 10 and 15 are exactly equal to the multiples of 30. (As a result of poset theory, this says that in the poset of positive integers ordered by the divisor relation, least upper bounds exist for any finite set.)