THINK++ — Engineering Visualized

📖 LESSON

GCD & LCM

Greatest Common Divisor (GCD) and Least Common Multiple (LCM) are essential for solving problems involving fractions, periods, and divisibility.

Euclidean Algorithm

gcd(a, b) = gcd(b, a % b)

LCM Formula

lcm(a, b) = (a * b) / gcd(a, b)

Basic Property

gcd(a, b) * lcm(a, b) = a * b

Gcd And Lcm

Simulation Lab v2.0

Graph Engine Ready

Timeline

1/6

Edit Mode

Speed1000ms

Double-Click to Spawn

Drag Panels to Organize

💡 Euclidean Algorithm

The Euclidean algorithm is extremely efficient, with a time complexity of **O(log(min(a, b)))**. It's the standard way to compute GCD in almost all programming languages.

Loading Lab...