Number Theory
Least common multiple (LCM)
The smallest positive integer divisible by both a and b; equals ab / gcd(a,b) and is computed by taking max exponents across prime factorizations.
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.