Calculation·mathematics 13

Greatest common divisor·Least common multiple calculator

Calculate the greatest common divisor and multiple criteria for multiple positive whole numbers.

Input

The example value has been entered. Check it immediately or change the value.

Run with Ctrl or ⌘ + Enter

Input is processed in the browser. Refreshing returns a sample value.

Result

Check or change the value using the example value result.

Calculated precisely using integer operations. Up to 100 items, each value is less than 1 trillion

Share result

Share the tool link and result text together. No URL is included in the result. Check the below content and then share it.

Calculation·conversion criteria

Find the common divisor and multiple for multiple whole numbers.

Lagrange’s algorithm, lcm(a,b) = a ÷ gcd(a,b) × b

Input example

The greatest common divisor of 12, 18, and 24 is 6, and the least common multiple is 72

The greatest common divisor of 12 and 18 is 6. The least common multiple is 12÷6×18=36, so we can check the interval when both cycles overlap.

How to use

  1. Use the entered example value or change the positive integer list items.
  2. Click Verify result and check the following result.
  3. Result can be copied if needed.

Frequently Asked Questions

Can 0 or a negative number be entered?

This tool accepts only positive integers. It does not apply separate definitions for greatest common divisor or least common multiple that include 0. Up to 100 numbers can be calculated together.

Calculation criteria and reference materials

The calculation formula and scope of this tool are disclosed in the above description. Examples can be checked by substituting input values into the formula or following the specified string and calendar handling rules.

Verification of calculation criteria: · Calculation·verification principles · Report errors