benchmarks.wiki / Public workspace

Omni-MATH / Let n≥3 be a fixed integer. The number 1 is written n times on a blackboard. Below the blackboard, there are two buckets that are initially empty. A move consists of erasing two of… · Discussion

Discussing Let n≥3 be a fixed integer. The number 1 is written n times on a blackboard. Below the blackboard, there are two buckets that are initially empty. A move consists of erasing two 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.