benchmarks.wiki / Public workspace

Omni-MATH / The workers laid a floor of size n×n (10<n<20) with two types of tiles: 2×2 and 5×1. It turned out that they were able to completely lay the floor so that the same number of tiles …

Problem

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

problem

The workers laid a floor of size n×nn\times n (10<n<2010 <n <20) with two types of tiles: 2×22 \times 2 and 5×15\times 1. It turned out that they were able to completely lay the floor so that the same number of tiles of each type was used. For which nn could this happen? (You can’t cut tiles and also put them on top of each other.)
Plain-text mathematical notation (without MathML)
The workers laid a floor of size n×n (10<n<20) with two types of tiles: 2×2 and 5×1. It turned out that they were able to completely lay the floor so that the same number of tiles of each type was used. For which n could this happen?  (You can’t cut tiles and also put them on top of each other.)
Original LaTeX notation
The workers laid a floor of size $n\times n$ ($10 <n <20$) with two types of tiles: $2 \times 2$ and $5\times 1$. It turned out that they were able to completely lay the floor so that the same number of tiles of each type was used. For which $n$ could this happen?  (You can’t cut tiles and also put them on top of each other.)

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