Lowest common multiple & greatest common divisor
This script finds the lowest common multiple and the greatest common divisor of an array of numbers.» Entering your input
- Only positive integers (e.g.: 2,5,1234,19283)
- Numbers may not be higher than 2599417 and not lower than 2.
- Seperate numbers with a comma (e.g.: "156,189,5467").
» What this is
The lowest common multiple (lcm) and the greatest common divisor (gcm) of the numbers you enter will be generated. The lowest common multiple is the smallest possible number that is dividable by ALL numbers you supply (e.g.: lcm(24,36) = 72). The greatest common divisor on the other hand is the smallest possible number by which all numbers can be divided. (e.g.: gcd(24,36) = 12).
Please refer to the Wikipedia article to least common multiple and greatest common divisor for more information.