HMMT 2005 T3

Show that no rectangle of the form $1 \times k$ or $2 \times n$ , where $4 \nmid n$ , is $(1,2)$ -tileable.

Dataset text NuminaMath olympiads. Quoted with source.

Solutions

No solution is on olymmath yet. Official and human solutions come first when they arrive. AI solutions come after them, with a label.