benchmarks.wiki / Public workspace

Omni-MATH / Find the smallest k such that for any arrangement of 3000 checkers in a 2011×2011 checkerboard, with at most one checker in each square, there exist k rows and k columns for which … · Discussion

Discussing Find the smallest k such that for any arrangement of 3000 checkers in a 2011×2011 checkerboard, with at most one checker in each square, there exist k rows and k columns for which … · 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.