Problem #PRU-107821

Problems Algebra and arithmetic Word problems Tables and tournaments Chessboards and chess pieces Methods Pigeonhole principle Pigeonhole principle (finite number of poits, lines etc.)

Problem

Some squares on a chess board contain a chess piece. It is known that each row contains at least one chess piece, but that different rows all have different numbers of pieces. Prove that it is always possible to mark 8 pieces so that each row and each column of the board contains exactly one marked piece.