Conjecture on nim-values for the divide-and-residue game
Conjecture on nim-values for the divide-and-residue game
From papers
Consider the divide-and-residue game, and let denote the nim-value of a heap of size . Divide-and-residue conjecture. Every nim-value occurs for at least one heap size and for at most finitely many heap sizes. Moreover,
as . The statement combines the finite-occurrence claim with an asymptotic bound on the nim-values; the source supplies no resolution of these assertions.
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
Douglas E. Iannucci and Urban Larsson, “Game values of arithmetic functions”, arXiv:2101.07608 (2021).
Solutions 0
Sign in to submit a solution.
No solutions have been posted yet.