🏟️ Battle Arena
Dividend (a)
48
⚔️
Divisor (b)
18
🏆 GCD Champion
6
📜 Battle Log
START
Enter values and click Attack!
📚 Euclid's Algorithm
The GCD (Greatest Common Divisor) is the largest number that divides both numbers evenly.
Division Method: GCD(a, b) = GCD(b, a % b) until
b = 0
Each "attack" performs: a = b, b = a % b.
When b becomes 0, a is the GCD!