1 problem

The modulo-three conjecture for all-heads coin sequences
Modulo-three conjecture. The sequence $1^n$ is removable if and only if
openFrom paperscoin-removal combinatorial-games modular-arithmetic
0 responses
9