MathDB

Each square of a

5 \times 5

board is painted red or blue, in such a way that the following condition is fulfilled: “For any two rows and two columns, of the

4

squares that are in their intersections, there are

4

2

0

painted red.” How many ways can the board be painted?

Problem Statement