Problem #WSP-000203

Problemas Matemáticas Discretas Teoría de Algoritmos Teoría de Juegos Posiciones Ganadoras y Perdedoras

Problem

Arthur and Dan play the following game. There are \(26\) beads on the necklace. Each boy is allowed to take \(1,2,3\) or \(4\) beads at once. The boy who cannot take any more beads loses. Arthur starts - who will win?