Claims

../

2003_02_13_kiss: Kiss proves that among coprime k-element subsets of the first n integers, k at least 2, the set of the k largest leaves the most positive integers without a representation, which answers Problem 434 affirmatively.

2026_02_24_joshuab: An AI-assisted Lean proof, posted to the site's forum, that the k largest integers leave the most gaps for k between 2 and n, arguing interval by interval from Dixmier's Theorem 2 rather than by Kiss's count.

---