benchmarks.wiki / Public workspace

Omni-MATH / A square grid 100×100 is tiled in two ways - only with dominoes and only with squares 2×2. What is the least number of dominoes that are entirely inside some square 2×2?

Problem

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

problem

A square grid 100×100100 \times 100 is tiled in two ways - only with dominoes and only with squares 2×22 \times 2. What is the least number of dominoes that are entirely inside some square 2×22 \times 2?
Plain-text mathematical notation (without MathML)
A square grid 100×100 is tiled in two ways - only with dominoes and only with squares 2×2. What is the least number of dominoes that are entirely inside some square 2×2?
Original LaTeX notation
A square grid $100 \times 100$ is tiled in two ways - only with dominoes and only with squares $2 \times 2$. What is the least number of dominoes that are entirely inside some square $2 \times 2$?

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