Maths Olympiad Prep

Library / /6 of 10

, 2015

Combinatorics Difficulty 5.7 AIME, harder Prove it Taiwan

Suppose you have two types of tetrominoes made of four squares each; the two on the left are called “S-type”, and the two on the right are called “Z-type”.
Figure 1
Consider a white chess board of infinite size, on which each square is the same size as a square of the tetrominoes. We pick some squares on the board and paint them black. Assume that we can use only S-type tetrominoes to cover all black squares without covering any white one. Prove that, if we use S and (or) Z-type tetrominoes to cover all black squares instead, without covering any white one, then we must use an even number of Z-type tetrominoes.

Solution

Let BB be the set of black squares. Color the infinite chess board in red and green as follows: notice that an S-type tetromino must cover an even number of red squares, while a Z-type tetromino must cover an odd number of red squares.
Figure 2
Since BB can be formed by S-type tetrominoes, BB must contain an even number of red squares. Therefore, if we instead use S and (or) Z-type tetrominoes, the number of Z-type tetrominoes must be even. Q.E.D.

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: MathNet, licensed CC-BY-4.0. Statement translated into English from zh; metadata (topic, difficulty) added by this project.