Number Theory
Greatest common divisor (GCD)
The largest positive integer dividing two integers; computed efficiently via the Euclidean algorithm, with gcd(a,b)·lcm(a,b) = |ab|.
0
Contest appearances
100
Practice problems
1–10
Difficulty levels
Drill this topic
Sign in and tell the coach to drill this knowledge point — it picks questions matched to your current level.