benchmarks.wiki / Public workspace

Omni-MATH / For a given positive integer k find, in terms of k, the minimum value of N for which there is a set of 2k+1 distinct positive integers that has sum greater than N but every subset … · Discussion

Discussing For a given positive integer k find, in terms of k, the minimum value of N for which there is a set of 2k+1 distinct positive integers that has sum greater than N but every subset … · 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.