HMMT 2005 T5

Show that for $b$ even, there exists some $M$ such that for every $n>M$ , a $2 b \times n$ rectangle is $(1, b)$ -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.