Library / /12 of 151

, 2019

Combinatorics Difficulty 6.0 National Olympiad Prove it Hungary

Given are two polyominos, the first one is an L-shape consisting of three squares, the other one contains at least two squares. Prove that if $n$ and $m$ are co-prime then at most one of the $n\times n$ and $m\times m$ boards can be tiled by translated copies of the two polyominos.

Want a route through all this instead of an archive? The track puts 2,000 problems in a working order, from AMC 10 level to the IMO shortlist.

Source: KöMaL, licensed Rights held by KöMaL and the MATFUND Foundation. Statement reproduced verbatim; metadata (topic, difficulty) added by this project. Solutions are the publisher's, linked not copied.