benchmarks.wiki

benchmarks.wiki / Public workspace

Omni-MATH / Some squares of a n×n table (n>2) are black, the rest are white. In every white square we write the number of all the black squares having at least one common vertex with it. Find …

Problem

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

problem

Some squares of a n×nn \times n table (n>2)(n>2) are black, the rest are white. In every white square we write the number of all the black squares having at least one common vertex with it. Find the maximum possible sum of all these numbers.
Plain-text mathematical notation (without MathML)
Some squares of a n×n table (n>2) are black, the rest are white. In every white square we write the number of all the black squares having at least one common vertex with it. Find the maximum possible sum of all these numbers.
Original LaTeX notation
Some squares of a $n \times n$ table $(n>2)$ are black, the rest are white. In every white square we write the number of all the black squares having at least one common vertex with it. Find the maximum possible sum of all these numbers.

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
8173b4c4-ba34-5a80-8c9c-8e8ad49d7404
task_key
test--8173b4c4-ba34-5a80-8c9c-8e8ad49d7404
task_revision_id
1
config / split
/ test

Official source

initial import