MathDB

There are

n

matches on the table (

n > 1

). Two players take turns shooting them from the table. On the first move, the player removes any number of matches from the table from

1

n - 1

, and then each time you can take no more matches from the table, than the partner took with the previous move. The one who took the last match wins.. Find all

n

for which the first player can provide win for yourself.

Problem Statement