benchmarks.wiki

benchmarks.wiki / Public workspace

Omni-MATH / A nonempty set S is called well-filled if for every m∈S, there are fewer than (1)/(2)m elements of S which are less than m. Determine the number of well-filled subsets of … · Discussion

Discussing A nonempty set S is called well-filled if for every m∈S, there are fewer than (1)/(2)m elements of S which are less than m. Determine the number of well-filled subsets of … · 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.