Greatest common divisor
Groups, moves and rules · GCD
created · updated
The largest number that divides both numbers. GCD(3, 2) = 1, and the number one can be assembled from them by adding and subtracting: 1 = 3 − 2. Like coins of 3 and 2 roubles: you hand over 3, get 2 back in change, and are left with 1 rouble. This is what lets the game “step and lift” get one entry in place of two.
Source: Wikipedia: Greatest common divisor
Read more: Why the accountant needs one entry: three and two
Where it appears · 1
- How many rules does a game need · Research