The Ultimate Trial of GCD & LCM
👉 Workshop Rules:
💎 [Crystal Cutting]: Greatest Common Divisor (GCD). Cut the crystal into the largest possible squares without leaving any waste!
⚙️ [Gear Sync]: Least Common Multiple (LCM). Predict how many seconds it takes for two gears to return to the starting point simultaneously!
🧮 [Short Division Extractor]: Calculate the GCD or LCM based on the short division diagram. (Trap: Do not mix up the positions for factors and multiples!)
⚠️ 12 levels in total. Predict the answer before verifying with animation! +20 pts for correct, -10 pts for wrong predictions.
💎 [Crystal Cutting]: Greatest Common Divisor (GCD). Cut the crystal into the largest possible squares without leaving any waste!
⚙️ [Gear Sync]: Least Common Multiple (LCM). Predict how many seconds it takes for two gears to return to the starting point simultaneously!
🧮 [Short Division Extractor]: Calculate the GCD or LCM based on the short division diagram. (Trap: Do not mix up the positions for factors and multiples!)
⚠️ 12 levels in total. Predict the answer before verifying with animation! +20 pts for correct, -10 pts for wrong predictions.
Level 1
Preparing...
🤔 Enter your prediction: