MathDB
2008 PUMaC Combinatorics B4

Source:

October 4, 2019
combinatorics

Problem Statement

A 2008×20092008 \times 2009 rectangle is divided into unit squares. In how many ways can you remove a pair of squares such that the remainder can be covered with 1×21 \times 2 dominoes?
Back to ProblemsView on AoPS