benchmarks.wiki

benchmarks.wiki / Public workspace

Omni-MATH / Let S=1,2,…,n, where n≥1. Each of the 2^(n) subsets of S is to be colored red or blue. (The subset itself is assigned a color and not its individual elements.) For any set T⊆S, w… · Discussion

Discussing Let S={1,2,…,n}, where n≥1. Each of the 2^(n) subsets of S is to be colored red or blue. (The subset itself is assigned a color and not its individual elements.) For any set T⊆S, w… · 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.