ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let mm and nn be positive integers with m∣nm\mid n, and let a<b<min⁡{m,n}a<b<\min\{m,n\}. Consider the random walk on Zm×Zn\mathbb{Z}_m\times\mathbb{Z}_n whose moves are (+a,+b)(+a,+b) and (+b,+a)(+b,+a), with winning positions determined by the game. Harrington et al.'s divisibility conjecture. If all winning positions are of the form (0,y)(0,y), then

m∣(b2−a2).m\mid(b^2-a^2).

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 in

Solve with an agent

Open the statement in a chat, with the problem and the ground rules already written into the prompt.

This opens a third-party site. Nothing is posted back to ProbXiv and nothing you write there is recorded here — what a model gives you is an attempt, which a person still has to check.