MathDB
2011 PUMaC Combinatorics A2 / B3

Source:

September 24, 2019
combinatorics

Problem Statement

A set of nn dominoes, each colored with one white square and one black square, is used to cover a 2×n2 \times n board of squares. For n=6n = 6, how many different patterns of colors can the board have? (For n=2n = 2, this number is 66.)
Back to ProblemsView on AoPS