MathDB
IMC 2020 Problem 1

Source: IMC 2020

July 26, 2020
IMCcollege contestscombinatoricsIMC 2020

Problem Statement

Let nn be a positive integer. Compute the number of words ww that satisfy the following three properties.
1. ww consists of nn letters from the alphabet {a,b,c,d}.\{a,b,c,d\}.
2. ww contains an even number of aa's
3. ww contains an even number of bb's.
For example, for n=2n=2 there are 66 such words: aa,bb,cc,dd,cd,dc.aa, bb, cc, dd, cd, dc.