benchmarks.wiki / Public workspace

Omni-MATH / Compute the number of sets S such that every element of S is a nonnegative integer less than 16, and if x∈S then (2 x bmod 16) in S. · Discussion

Discussing Compute the number of sets S such that every element of S is a nonnegative integer less than 16, and if x∈S then (2 x bmod 16) in S. · 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.