benchmarks.wiki

benchmarks.wiki / Public workspace

Omni-MATH / Find the number of ways to choose two nonempty subsets X and Y of 1,2,…,2001, such that |Y|=1001 and the smallest element of Y is equal to the largest element of X. · Discussion

Discussing Find the number of ways to choose two nonempty subsets X and Y of {1,2,…,2001}, such that |Y|=1001 and the smallest element of Y is equal to the largest element of X. · 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.