Cinna Davis and GPT-6.2 Astra, 18 November 2026
In the partition game CUT, a move with cut size splits one pile into nonempty piles of the same total size. Write for the Sprague–Grundy value of a pile of size when the allowed cut sizes form . A position with several piles has value equal to the bitwise XOR of their values. The value of a pile is the least nonnegative integer absent from its option values.
Theorem. Let , where is a nonempty set of even integers at least , and is a nonempty set of odd integers at least . Put and . Then
If , the two sequences differ at some . The sets may be infinite.
Ellis and Thanatipanonda conjectured in Section 7, Conjecture 2, that suffices for equality. Their Theorems 3 and 19 give the two published inputs below. Published paper, open text
The base game
Put . Theorem 19 gives the same sequence for . Theorem 3 gives for and . The six blocks of each have length . In the table, a parenthesized pair repeats to fill its block.
| Residue interval | Values in order |
|---|---|
| , followed by repetitions of | |
Why a large cut preserves the value
We show that whenever piles of positive sizes sum to , their XOR under is strictly less than .
Write with , and put , . Since all , the XOR is exactly
The XOR of the quotients is at most their sum . If , then gives , whereas the displayed value is at most .
It remains to consider . Now . Each residue uses units in excess of its mandatory first unit, for a total of .
| Range of | Consequence for the residues | Upper bound on their XOR of -values | Lower bound on |
|---|---|---|---|
| , so every residue is at most . | |||
| , so every residue is at most and at most one exceeds . | |||
| , so every residue is at most . If one exceeds , all others are at most . |
For the last row, if all residues are at most , their values all lie between and , which is closed under XOR. Otherwise the single larger residue has value , or . All other values are or , so their XOR with it is at most . This proves the strict inequality in every case.
Suppose and induct on . By induction every smaller pile has value in the enlarged game. The options from cuts in therefore already have least excluded value . Every added odd cut produces at least piles and hence an option of value strictly below . Adding such options leaves the least excluded value equal to . The initial pile of size one has no moves. This proves sufficiency for all .
Why the cutoff is sharp
Suppose . Make a cut of size on a pile of size . Choose one part of size and the other parts in with sum . This is possible since . Every sum between and is obtained by distributing up to extra units per part.
The sum and the count are both odd, so an even number of these parts are even. In the first block exactly when is even. Their XOR is therefore zero. The whole move has base value , which equals by the last entry of the fourth block.
If the two games agree at every smaller pile, this legal move to value forces the enlarged game's least excluded value at to differ from . Otherwise a difference already occurs earlier. Finally, is odd and is even, so the two cases exhaust Family B.
Verification and prior work
The accompanying checker computes options directly from pile splits and the least-excluded-value rule. It compares the two sequences on both sides of the cutoff, including multi-cut sets and piles spanning multiple periods. The proof above covers arbitrary sizes.
A literature search on 18 November 2026 by author names, conjecture number, Family B and the odd-cut threshold located the original conjecture and the authors' theorem about adding even cuts. A separate formal result explicitly treats their Family A conjecture. We found no earlier resolution of Conjecture 2 in those sources. Priority remains provisional. Ellis and Thanatipanonda, Family A result and scope