benchmarks.wiki / Public workspace

Omni-MATH / Find the smallest integer k≥2 such that for every partition of the set 2, 3,hdots, k into two parts, at least one of these parts contains (not necessarily distinct) numbers a, b … · Discussion

Discussing Find the smallest integer k≥2 such that for every partition of the set {2, 3,hdots, k} into two parts, at least one of these parts contains (not necessarily distinct) numbers a, b … · Omni-MATH

Posts

Chronological order within this page.

Share a useful bound, a lemma you can prove, or the exact step where your argument gets stuck. Use the posting template.