Euclid's Algorithm Calculator
Enter two integers to calculate their Greatest Common Divisor (GCD) using Euclid’s Algorithm.
Euclid’s Algorithm is one of the oldest and most efficient methods for finding the Greatest Common Divisor (GCD) of two integers. The GCD is the largest integer that divides both numbers without leaving a remainder.
The algorithm works by repeatedly replacing the larger number with the remainder when divided by the smaller number, until the remainder becomes zero. The last non‑zero remainder is the GCD.
This calculator will:
- Accept two integers.
- Show step‑by‑step execution of Euclid’s Algorithm.
- Display the GCD and optionally the LCM (Least Common Multiple).
Euclid’s Algorithm Calculator – Learn and Compute GCD Online
This free online calculator helps you understand and apply Euclid’s Algorithm to find the Greatest Common Divisor (GCD) of two integers. Euclid’s Algorithm is one of the oldest mathematical methods, dating back to ancient Greece, and is still widely used today in computer science, cryptography, and number theory.
Example:
For numbers 48 and 18, the calculator shows:
- (48 ÷ 18 = 2) remainder 12
- (18 ÷ 12 = 1) remainder 6
- (12 ÷ 6 = 2) remainder 0
Thus, GCD = 6, and LCM = 144.