โ† Back to Games

๐Ÿ”ฅ The Common Multiple Forge

Craft the LCM using multiplication and GCD extraction!

โš’๏ธ The Forging Process
๐Ÿ”ข
Number A
12
ร—
๐Ÿ”ข
Number B
18
รท
โš”๏ธ
GCD(A, B)
?
=
โœจ
LCM
?
๐Ÿ† Forged Successfully!
36
LCM(a, b) = (a ร— b) / GCD(a, b)
LCM(12, 18) = (216) / ? = ?
๐Ÿ“œ Forging Steps

๐Ÿ“š Why This Formula Works

The LCM (Least Common Multiple) is the smallest number that both A and B divide into evenly.

Key insight: A ร— B contains all factors of both numbers, but counts common factors twice. Dividing by GCD removes the double-counted factors!

Example: For 12 and 18:
โ€ข 12 = 2ยฒ ร— 3
โ€ข 18 = 2 ร— 3ยฒ
โ€ข LCM = 2ยฒ ร— 3ยฒ = 36 (take max power of each prime)