benchmarks.wiki / Public workspace

Omni-MATH / Let S be a subset of 1,2,3,…,12 such that it is impossible to partition S into k disjoint subsets, each of whose elements sum to the same value, for any integer k≥2. Find the max… · Discussion

Discussing Let S be a subset of {1,2,3,…,12} such that it is impossible to partition S into k disjoint subsets, each of whose elements sum to the same value, for any integer k≥2. Find the max… · 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.