Problem #PRU-102883

Problems Algebra and arithmetic Discrete Mathematics Combinatorics

Problem

Prove that the number of all arrangements of the largest possible amount of peaceful bishops (figures that move on diagonals and don’t threaten each other) on the \(8\times 8\) chessboard is an exact square.