2011 PUMaC Combinatorics A4 / B6
Source:
September 24, 2019
combinatorics
Problem Statement
Let be the number of ways to place bishops on a chessboard such that no are on the same diagonal. Find the remainder when is divided by . (Note: the length of a diagonal on a chessboard can be 2, 3, 4, or 5.)