benchmarks.wiki

benchmarks.wiki / Public workspace

Omni-MATH / Integers n and k are given, with n≥k≥2. You play the following game against an evil wizard. The wizard has 2n cards; for each i=1,...,n, there are two cards labeled i. Initially, t… · Discussion

Discussing Integers n and k are given, with n≥k≥2. You play the following game against an evil wizard. The wizard has 2n cards; for each i=1,...,n, there are two cards labeled i. Initially, t… · 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.