MathDB
grids covered by one square in chessboard

Source: IMOC 2018 C2

August 16, 2021
combinatorics

Problem Statement

Given an odd n∈Nn\in\mathbb N. In an n×nn\times n chessboard, you may place many 2×22\times2 squares. How many grids, at most, are covered by exactly one square?
Back to ProblemsView on AoPS