Arithmetic periodicity for Family A cut games
Arithmetic periodicity for Family A cut games
Let be a non-empty set of even numbers, each at least , and let be a non-empty set of odd numbers, each at least . Write for the smallest element of . Family A consists of cut sets
or
Family A arithmetic-periodicity conjecture. The nim-sequence for every game of \textsc{cut} in this family is precisely . This concerns one of the families whose nim-sequence was described as unknown; proving arithmetic periodicity for Families A and B would imply Conjecture 1 of the cited prior work.
Progress summary
Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.
Sources & referencesView supporting material
Primary source
Paul Ellis and Thotsaporn Aek Thanatipanonda, “The Arithmetic-Periodicity of cut for C=\1,2c\”, arXiv:2203.02457 (2022).
Solutions 0
Sign in to submit a solution.
No solutions have been posted yet.