benchmarks.wiki / Public workspace

Omni-MATH / A 9×7 rectangle is tiled with tiles of the two types: L-shaped tiles composed by three unit squares (can be rotated repeatedly with 90^(∘)) and square tiles composed by four unit s…

Problem

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

problem

A 9×79\times 7 rectangle is tiled with tiles of the two types: L-shaped tiles composed by three unit squares (can be rotated repeatedly with 90∘90^\circ) and square tiles composed by four unit squares. Let n≥0n\ge 0 be the number of the 2×22 \times 2 tiles which can be used in such a tiling. Find all the values of nn.
Plain-text mathematical notation (without MathML)
A 9×7 rectangle is tiled with tiles of the two types: L-shaped tiles composed by three unit squares (can be rotated repeatedly with 90^(∘)) and square tiles composed by four unit squares.
Let n≥0 be the number of the 2×2 tiles which can be used in such a tiling. Find all the values of n.
Original LaTeX notation
A $9\times 7$ rectangle is tiled with tiles of the two types: L-shaped tiles composed by three unit squares (can be rotated repeatedly with $90^\circ$) and square tiles composed by four unit squares.
Let $n\ge 0$ be the number of the $2 \times 2 $ tiles which can be used in such a tiling. Find all the values of $n$.

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

Official source

initial import