1. When you can win Nim
Say there are s = 4n + i (i = 1, 2, 3) stones on the table.
1.1 Initial state
Consider the case where n = 0, there are at most 3 stones on the table. You take the first turn to remove all the stones, then you win.
1.2 Deduction state
Suppose s = 4n + i (i = 1, 2, 3) stones on the table, you could we the game.
Consider the case where k = n + 1. There are s = 4(n+1) + i (i = 1, 2, 3) stones on the table.
1. You could always take the first turn to remove i stones.
2. Then the opponent take the next turn to remove whatever stones he wants.
The numb