GCD and LCM Calculator

Find the greatest common divisor and least common multiple of two positive integers. Use both answers to check fraction work and repeating schedules.

  • Free
  • No sign-up
  • Runs in your browser

Your numbers stay in your browser. Nothing is uploaded or saved.

Result

Greatest common divisor–

Enter the required values to see your result. Use the example to try the complete calculation.

Both inputs must be positive integers up to ten million. Euclid’s algorithm finds the divisor; the product divided by it gives the multiple.

Powered by VISU

How this calculation works

GCD and LCM Calculator

Find the greatest common divisor and least common multiple of two positive integers. Use both answers to check fraction work and repeating schedules.

Units and limits

Both inputs must be positive integers up to ten million. Euclid’s algorithm finds the divisor; the product divided by it gives the multiple.

Formulas

Calculation
LCM(a,b) = a × b / GCD(a,b)

Give your project a place to be found

Use VISU Link to bring your project links together on one page. This calculator remains free and works without an account.

Discover VISU Link

How to use it

  1. Choose the operation when available and enter your own values in the labelled fields.
  2. Check the units and the limits explained below before interpreting the answer.
  3. Read the result and its details. Copy it or download a result card; no account is required.

Examples

  • Worked example

    For 18 and 24, the GCD is 6 and the LCM is 72.

  • Another case

    For 7 and 9, the GCD is 1 and the LCM is 63.

Add this tool to your site

Put this tool on your blog, store or club site. It runs inside your page, free, with no account, and a small "by VISU" credit line under it.

Questions

What does this tool calculate?

Find the greatest common divisor and least common multiple of two positive integers. Use both answers to check fraction work and repeating schedules.

Which inputs and units should I use?

Both inputs must be positive integers up to ten million. Euclid’s algorithm finds the divisor; the product divided by it gives the multiple.

Can I check a worked example?

For 18 and 24, the GCD is 6 and the LCM is 72.

Are my input values uploaded or stored?

No. The calculation runs in this browser. Typed values are not sent to analytics, placed in the page URL or saved by the calculator. Copying or downloading is an action you choose.

Do I need an account or a paid plan?

No. The calculation, example, result copy and result card are available without registration. VISU services are an optional next step.

Add this tool to your site

Free for you and your visitors. Pick a size, copy the code and paste it into any page of your site.

Width
Frame
Credit line
  1. Copy the code.
  2. In your site editor, add an HTML or "custom code" block where the tool should appear.
  3. Paste the code and publish. The height adjusts by itself.

The credit line under the tool links to the original page. Keep it if the tool is useful to you.

Preview

GCD and LCM Calculator by VISU