Scribd
Upload
195 views

Problem 18 Combinatorics

This document summarizes an explicit formula for the sum of terms from 0 to 3n where each term is of the form (3n choose k). The solution uses the fact that (1 + x)^3n can be written as a polynomial in x with coefficients representing the terms in the sum. By evaluating this polynomial at the cube roots of unity and taking the average, the terms that don't sum to 0 cancel out, leaving the desired explicit formula for the sum. The final explicit formula is S = (8n + 2(-1)^n)/3, which simplifies notions about the cube roots of unity evaluating to 0 or -1.

Uploaded by

seansoni
Copyright
© Attribution Non-Commercial (BY-NC)
Available Formats
Download as PDF, TXT or read online on Scribd
195 views

Problem 18 Combinatorics

This document summarizes an explicit formula for the sum of terms from 0 to 3n where each term is of the form (3n choose k). The solution uses the fact that (1 + x)^3n can be written as a polynomial in x with coefficients representing the terms in the sum. By evaluating this polynomial at the cube roots of unity and taking the average, the terms that don't sum to 0 cancel out, leaving the desired explicit formula for the sum. The final explicit formula is S = (8n + 2(-1)^n)/3, which simplifies notions about the cube roots of unity evaluating to 0 or -1.

Uploaded by

seansoni
Copyright
© Attribution Non-Commercial (BY-NC)
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 1

Problem 18: Combinatorics AoPS

     
3n 3n 3n
Problem: For positive integers n find an explicit formula for + + ··· + .
0 3 3n

Solution: Consider f (x) = (1 + x)3n . This is obviously

3n  
X 3n k
f (x) = x .
k
k=0

If we plug in x = 1, ω, ω 2 , the cube roots of unity, we get

3n  
X 3n
f (1) =
k
k=0

3n  
X 3n k
f (ω) = ω
k
k=0

3n  
X 3n 2k
f (ω 2 ) = ω .
k
k=0

Sum these up. Notice that 1 + ω + ω 2 = 0 and ω 3 = 1 so 1k + ω k + ω 2k = 0 when k ≡ 1, 2


(mod 3). When k ≡ 0 (mod 3), we get 1k +ω k +ω 2k = 3. So take one-third of this expression
to get the desired sum.

1
3 (f (1) + f (ω) + f (ω 2 )) = 13 (23n + (ω + 1)3n + (ω 2 + 1)3n ).

This can be further simplfied by noting that ω 2 + 1 = −ω and ω + 1 = −ω 2 , hence:

1
1
23n + (−1)3n (ω 6n + ω 3n ) = 1
23n + 2(−1)3n = (8n + 2(−1)n )
 
S= 3 3 3

Note: The technique used here is sometimes called roots of unity filtering. This same
technique was used in Problem 17, so look at it if you are having trouble understanding the
solution.

Solution was written by Jeffrey Wang and compiled from Art of Problem Solving Forums.

You might also like