GCD and LCM Calculator

Find the greatest common divisor and least common multiple of a list of integers.

Your workspace

Server processing

Review the example values, then run the tool.

This tool calculates the greatest common divisor (GCD) and least common multiple (LCM) for a provided sequence of integers.

How to calculate GCD and LCM

  1. Enter a list of integers separated by commas into the input field.
  2. Submit the form to process the arithmetic for your specific list.
  3. Review the calculated GCD and LCM values displayed in the results area.

Understanding the calculation

The GCD represents the largest positive integer that divides each of the numbers in your list without leaving a remainder. The LCM represents the smallest positive integer that is divisible by every number in your list. The tool processes between one and one hundred integers, with each integer allowed to be as large as one trillion.

Result availability and limits

All calculations are performed on the server. Because these are temporary arithmetic scenarios, results and submitted jobs expire after 15 minutes. Ensure you save or copy any data you need before this time elapses.

Example input and output

12,18,24

The tool returns the greatest common divisor and the least common multiple for the provided set of integers.

Frequently asked questions

How many integers can I enter at once?

You can enter between 1 and 100 integers in a single request.

What is the maximum size for each integer?

Each integer in your list can be up to one trillion.

Continue your workflow