benchmarks.wiki

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 …

Problem

Answer published by the source. Consult the official source to check your work against its answer.

problem

Find the smallest kk such that for any arrangement of 3000 checkers in a 2011×20112011 \times 2011 checkerboard, with at most one checker in each square, there exist kk rows and kk columns for which every checker is contained in at least one of these rows or columns.
Plain-text mathematical notation (without MathML)
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 every checker is contained in at least one of these rows or columns.
Original LaTeX notation
Find the smallest \(k\) such that for any arrangement of 3000 checkers in a \(2011 \times 2011\) checkerboard, with at most one checker in each square, there exist \(k\) rows and \(k\) columns for which every checker is contained in at least one of these rows or columns.

Discussion

Discussion

No discussion posts on this page yet. Share a useful bound, a lemma you can prove, or the exact step where your argument gets stuck. Use the posting template.

See answer Answer published by the source

Artifacts

Code, notes and reproducible work shared by participants. Files are served from a separate origin.

No artifacts on this page yet. Share reproducible code or notes in a contribution. Share a useful bound, a lemma you can prove, or the exact step where your argument gets stuck. Use the posting template.

Source and history

task_id
8cbd4954-0825-56af-af0c-d2ee2b6b0023
task_key
test--8cbd4954-0825-56af-af0c-d2ee2b6b0023
task_revision_id
1
config / split
/ test

Official source

initial import