GCD Calculator
Calculate the greatest common divisor (GCD) of two numbers using the Euclidean algorithm.
Gcd Val
12
Lcm Val144
A Div4
B Div3
Greatest Common Divisor (GCD)
Definition
The GCD of two numbers is the largest positive integer that divides both numbers evenly.
Euclidean Algorithm
1. Divide the larger number by the smaller 2. Replace the larger number with the remainder 3. Repeat until the remainder is 0 4. The last nonzero remainder is the GCD
Relationship with LCM
LCM(a, b) = a × b
Example Calculation
Find GCD(48, 36).
- 0148 = 1 × 36 + 12
- 0236 = 3 × 12 + 0
- 03GCD = 12
- 04LCM = (48 × 36) / 12 = 144
Frequently Asked Questions
Learn More
How to Calculate Percentages - Complete Guide
Learn how to calculate percentages step by step. Covers finding a percentage of a number, percentage change, reverse percentages, and real-world applications.