A tiling of an n×n square grid is formed using 4×1 tiles. What are the possible values of n? [A tiling has no gaps or overlaps, and no tile goes outside the region being tiled.]
Want a route through all this instead of an archive? The track
puts 2,604 problems in a working order, from Junior Challenge level to the IMO shortlist.