MathDB
M coins on a n x n board Puerto Rico TST 2021.3

Source:

September 22, 2021
combinatorics

Problem Statement

Coins are placed in some squares on a n×nn\times n board. Each coin can be moved towards the square symmetrical with respect to either of the two diagonals, as long as that square is empty. The initial coin setup is said to be good , if any coin can make the first move. (a) Determine the maximum number of coins MM that can be placed on the n×nn\times n board, such that the configuration is good. (b) Calculate the total number of good configurations that have exactly MM coins.