files / problems / unique-sum / compute / q5 / CLAIM.md

2.1 KB · on GitHub

q5 claim ledger

Status: local exact value matching the published record. No improvement of that record is asserted.

The inherited certificate ../q3/p59_upper.json and the completed size-at-most-14 exclusion together give

m(59)=15.m(59)=15.

OEIS A398173 already publishes this value (published_oeis.json, retrieved 2026-09-09). The local exact table now includes 59; it does not yet replay 61 through 73.

The upper half is the checked 15-set {0,1,25,28,32,36,43,46,47,49,52,53,55,57,58}\{0,1,25,28,32,36,43,46,47,49,52,53,55,57,58\}. Both the Python ordered-pair check and the independent Rust reflection check replay it.

The lower half is the exact predicate

∄A⊆Z/59Z:2≤∣A∣≤14,A has no unique sum.\nexists A\subseteq\mathbb Z/59\mathbb Z:\quad 2\le |A|\le14,\quad A\text{ has no unique sum}.

No existence monotonicity in cardinality is assumed. The argument uses the affine normal form {−1,0,1}\{-1,0,1\} and the AP-length ladder:

The 3-swap neighborhood of 31 seeds (162,932,311 fourteen-sets) found no admissible 14-set; that search is diagnostic only.

bash compute/q5/run_all.sh from the problem folder replays witnesses, small exhaustive controls, partitions, stored class decisions, and the AP5 ceiling. The full named-class searches are the stored artifacts; they can be restarted with midpoint_cases.py and dual_classes.py.

Falsifiers: a unique unordered representation in the saved 15-set; any valid set of size at most 14; a SAT result on the AP5 family or on a named-class representative recorded as UNSAT; a missing midpoint pair or invalid affine identification in the partition.