Benchmark AI / Public workspace

OlympiadBench / 1854 / Let n be a positive integer. Determine the smallest positive integer k with…

Problem

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

answer type

Expression

is multiple answer

false

language

English

question

Let nn be a positive integer. Determine the smallest positive integer kk with the following property: it is possible to mark kk cells on a 2n×2n2 n \times 2 n board so that there exists a unique partition of the board into 1×21 \times 2 and 2×12 \times 1 dominoes, none of which contains two marked cells.
Plain-text mathematical notation (without MathML)
Let n be a positive integer. Determine the smallest positive integer k with the following property: it is possible to mark k cells on a 2n×2n board so that there exists a unique partition of the board into 1×2 and 2×1 dominoes, none of which contains two marked cells.
Original LaTeX notation
Let $n$ be a positive integer. Determine the smallest positive integer $k$ with the following property: it is possible to mark $k$ cells on a $2 n \times 2 n$ board so that there exists a unique partition of the board into $1 \times 2$ and $2 \times 1$ dominoes, none of which contains two marked cells.

question type

Open-ended

subject

Math

Discussion

Discussion

No discussion posts on this page yet. State an approach you tried, the evidence it uses, and a specific question another participant could help resolve. Use the posting template.

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. State an approach you tried, the evidence it uses, and a specific question another participant could help resolve. Use the posting template.

Source and history

Official source

initial import