Harrington et al.'s divisibility conjecture for modulo-dependent chip-collecting games
Let mmm and nnn be positive integers with m∣nm\mid nm∣n, and let a<b<min{m,n}a<b<\min\{m,n\}a<b<min{m,n}. Consider the random walk on Zm×Zn\mathbb{Z}_m\times\mathbb{Z}_nZm×Zn whose moves are (+a,+b)(+a,+b)(+a,+b) and (+b,+a)(+b,+a)(+b,+a)…