Elysia Tools
Navigation
Math & Numbers
Calculate the greatest common divisor and least common multiple for two or more integers
Execution
Fill in the form, run the tool, and review the result in one place.
Samples
Related
Tool usage guide
The GCD & LCM Calculator is a straightforward mathematical utility designed to instantly find the greatest common divisor and least common multiple for any set of integers. Whether you are simplifying fractions, solving scheduling problems, or working on number theory assignments, this tool processes multiple comma-separated numbers at once to deliver accurate results in a structured JSON format.
Background
A planner is coordinating three bus routes that loop every 12, 18, and 24 minutes respectively.
Problem
Finding the exact time when all three buses will arrive at the main terminal simultaneously.
How to use
Enter '12, 18, 24' in the Numbers field and select 'Both GCD and LCM' or 'LCM only'.
Calculation Type: bothOutcome
The tool outputs an LCM of 72, indicating the buses will sync up every 72 minutes.
Background
A carpenter has wooden boards of lengths 48, 72, and 120 inches.
Problem
Cutting all boards into the longest possible equal segments without any leftover wood.
How to use
Input '48, 72, 120' into the Numbers field and select 'GCD only'.
Calculation Type: gcdYes, you can enter as many integers as you need, separated by commas, and the tool will compute the result for the entire set.
Enter whole numbers separated by commas, such as '12, 18, 24'.
Yes, the Calculation Type dropdown allows you to select 'LCM only', 'GCD only', or 'Both GCD and LCM'.
No, GCD and LCM calculations are mathematically defined for integers (whole numbers) only.
The results are returned as a structured JSON object containing the requested GCD and/or LCM values.
Outcome
The tool returns a GCD of 24, meaning the boards should be cut into 24-inch segments.