MathDB

In the first

1999

cells of the computer are written numbers in the specified order::

1

2

4

...

2^{1998}

. Two programmers take turns reducing in one move per unit number in five different cells. If a negative number appears in one of the cells, then the computer breaks down and the broken repairs are paid for. Which programmer can protect himself from financial losses, regardless of his partner’s moves, and how should he do this act?

Problem Statement