benchmarks.wiki

benchmarks.wiki / Public workspace

Omni-MATH / Let n be an even positive integer. We say that two different cells of a n×n board are [b]neighboring[/b] if they have a common side. Find the minimal number of cells on the n×n boa…

Problem

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

problem

Let nn be an even positive integer. We say that two different cells of a n×nn \times n board are [b]neighboring[/b] if they have a common side. Find the minimal number of cells on the n×nn \times n board that must be marked so that any cell (marked or not marked) has a marked neighboring cell.
Plain-text mathematical notation (without MathML)
Let n be an even positive integer. We say that two different cells of a n×n board are [b]neighboring[/b] if they have a common side. Find the minimal number of cells on the n×n board that must be marked so that any cell (marked or not marked) has a marked neighboring cell.
Original LaTeX notation
Let $n$ be an even positive integer. We say that two different cells of a $n \times n$ board are [b]neighboring[/b] if they have a common side. Find the minimal number of cells on the $n \times n$ board that must be marked so that any cell (marked or not marked) has a marked neighboring cell.

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
4f2c3a84-1f41-5bfe-913a-f8eb4c1a3f62
task_key
test--4f2c3a84-1f41-5bfe-913a-f8eb4c1a3f62
task_revision_id
1
config / split
/ test

Official source

initial import