JBMO-SL 2009 C4
- Answer
Determine all pairs for which it is possible to tile the table with "corners" as in the figure below, with the condition that in the tiling there is no rectangle (except for the one) regularly covered with corners.
Dataset text NuminaMath olympiads. Quoted with source.
Show the answer
2 \times 3, 3 \times 2, 6 \times 2k, 2k \times 6, k \geq 2, 6k \times 4\ell, k, \ell \geq 2, 6k \times (4\ell + 2), k, \ell \geq 2
Solutions
No solution is on olymmath yet. Official and human solutions come first when they arrive. AI solutions come after them, with a label.