Basics 0/129

Numbers and arithmetic · 2 of 4 Advanced

GCD and LCM

Find the greatest common divisor with Euclid's remainder steps, see why they work and how few they are, and compute the least common multiple without overflow.

2,388 words · 11 min read

Difficulty: how hard each problem is if its topic is new to you.

Core 5

Additional practice 7