MathDB
k squares in a n x n chessboard

Source: Polish MO Second Round 1971 p1

September 8, 2024
combinatoricscombinatorial geometryChessboard

Problem Statement

In how many ways can you choose k k squares on a chessboard n×n n \times n ( k≤n k \leq n ) so that no two of the chosen squares lie in the same row or column?
Back to ProblemsView on AoPS