Nerdulator> put something in

Greatest common divisor and lowest common multiple

GCD, LCM and the relationship between them for two integers.

Showing a worked example. Change the values and the result updates, and the answer lives in the URL.

Results

Greatest common divisor6the largest integer dividing both
Lowest common multiple36the smallest integer both divide
Product check216 = GCD × LCMgcd(a,b) × lcm(a,b) always equals |a × b|
CoprimeNo
Simplified ratio2 : 3
As a simplified fraction2/3

All calculators →

Greatest common divisor and lowest common multiple | Nerdulator