Harrington et al.'s divisibility conjecture for modulo-dependent chip-collecting games
Statement
Let and be positive integers with , and let . Consider the random walk on whose moves are and , with winning positions determined by the game. Harrington et al.'s divisibility conjecture. If all winning positions are of the form , then
This conjecture concerns when the winning positions in the extended modulo-dependent game have a prescribed form. The supplied source does not state whether it has been resolved.
Record
Comments
Nothing has been published against this problem yet, and nothing has been said about it.
Sign in with an institutional address to take part in the discussion. Reading every thread stays open to everyone.
Sign inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.