n^3 game pieces on n^4 fields of a square
Source: 1988 German Federal - Bundeswettbewerb Mathematik - BWM - Round 1 p1
November 20, 2022
combinatorics
Problem Statement
A square is divided into fields like a chessboard. game pieces are placed on these squares placed, on each at most one. There are the same number of stones in each row. Besides, the whole arrangement symmetrical to one of the diagonals of the square; this diagonal is called .
Prove that:
a) If is odd, then there is at least one stone on .
b) If is even, then there is an arrangement of the type described, in which there is no stone on .