Problem 23.1 Easy Free

Race to Fifty

Two players alternately name integers, each adding between 11 and 1010 (inclusive) to a running total that starts at 00. The player who names the number 5050 wins. You move first: what number should you say?

Work it out, then compare with the answer.

SolutionShow the worked solution

Call a total safe if the player who has just named it can force a win.

Claim. The safe totals are exactly those with t≡6(mod11)t \equiv 6 \pmod{11}, namely 6,17,28,39,506, 17, 28, 39, 50.

Safe totals stay safe. Suppose you have just named such a total t<50t<50. Your opponent adds some k∈{1,…,10}k\in\{1,\dots,10\}. You then add 11−k11-k, which also lies in {1,…,10}\{1,\dots,10\}. This brings the total to t+11t+11, which is again ≡6(mod11)\equiv 6 \pmod{11} and does not exceed 5050. Repeating this, you reach 5050 yourself, since 50=6+4⋅1150 = 6 + 4\cdot 11. The opponent can never reach 5050 first: from a safe total t≤39t\le 39 they can reach at most t+10<t+11≤50t+10<t+11\le 50.

Other totals are unsafe. Suppose the total t<50t<50 is not ≡6(mod11)\equiv 6 \pmod{11}. Let ss be the next value above tt with s≡6(mod11)s \equiv 6 \pmod{11}. Then 1≤s−t≤101\le s-t\le 10, so the player to move can jump to ss. The previous strategy then wins for that player.

Your first move. You can name any number from 11 to 1010, and the only safe one is 66. Any other choice loses:

  • from 1,…,51,\dots,5 your opponent jumps to 66;
  • from 7,…,107,\dots,10 your opponent jumps to 1717.

So you should say 66. After that, whenever your opponent adds kk, you add 11−k11-k, naming 17,28,3917, 28, 39 and finally 5050.

6\boxed{6}

Key idea. You can always complete each round to m+1=11m+1=11. Hence the winning totals are those congruent to the target modulo 1111.