about 1 month ago
Count positive integers n ≤ 2024 with n ≡ 0 or 2 mod 5; these 809 positions let Bob force a win in the 1-or-4 token removal game.
combinatorial game theory
winning losing positions
modular pattern
forced winning strategy
P-positions: n ≡ 0 or 2 (mod 5); count = 809 up to 2024
Cost
$0
Input
0tokens
Output
0tokens
Loading messages...
Traces
Start a Conversation or make an API call to see your traces appear here.
No span selected
Click on any span in the list to see detailed information