Maximum common divisors and least common multiples
The largest common divisor and minimum common multiple of multiple integers are calculated in batches.
Maximum common divisors and least common multiples User manual
- Fill in the parameters or select the file according to the form, and check the unit and format first.
- Enter 12, 18, 24 to get the greatest common divisor 6 and the minimum common multiple 72.
- Click the processing button to view the results, you can copy or download and save.
Calculation method and processing rules
Using the large integer Euclidean algorithm, the least common multiple is repeated by the product of two numbers divided by the greatest common divisor.
scope of use
The results are calculated according to the input parameters, please check the input and applicable scenarios.
Will the input content be saved on the server?
This tool handles input in the browser, and does not upload files or form content. Typing practice scores are only saved in the native browser.
Why may the result be different from other tools?
The results are calculated according to the input parameters, please check the input and applicable scenarios. Please compare the input unit, rounding method, applicable rules and data version first.