Problem

Source: Portugal OPM 2019 p4

Tags: Coloring, combinatorics



On a board with $3$ columns and $4$ rows, each of the $12$ squares will be painted green or white. In the first and last row, the number of squares painted green must be the same. Furthermore, in the first and last column, the number of squares painted green must also be unequal. How many different ways can you paint the board?