benchmarks.wiki

benchmarks.wiki / Public workspace

Omni-MATH / Let n be a nonnegative integer. Determine the number of ways that one can choose (n+1)² sets S_(i,j)⊆1,2,…,2n , for integers i,j with 0≤i,j≤n , such that: • for all 0≤i,j≤n , the… · Discussion

Discussing Let n be a nonnegative integer. Determine the number of ways that one can choose (n+1)² sets S_(i,j)⊆{1,2,…,2n} , for integers i,j with 0≤i,j≤n , such that: • for all 0≤i,j≤n , the… · 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.