benchmarks.wiki / Public workspace

Omni-MATH / A 0-1 sequence of length 2^(k) is given. Alice can pick a member from the sequence, and reveal it (its place and its value) to Bob. Find the largest number s for which Bob can alwa… · Discussion

Discussing A 0-1 sequence of length 2^(k) is given. Alice can pick a member from the sequence, and reveal it (its place and its value) to Bob. Find the largest number s for which Bob can alwa… · 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.