Scribd
Upload
147 views1 page

Math 465 - Introduction To Combinatorics Problem Set 2

Uploaded by

Sid Jha
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
147 views1 page

Math 465 - Introduction To Combinatorics Problem Set 2

Uploaded by

Sid Jha
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 1

MATH 465 - INTRODUCTION TO COMBINATORICS

PROBLEM SET 2

1. Use the binomial theorem to show that


n  
X n k
3n = 2 .
k
k=0

Give a combinatorial proof of this. (Hint: Problem 5 from PROBLEM SET 1.)
2. Compute the coefficient of x2 y 2 z 2 in (3 + xy + yz + xz)4 .

3. Find one binomial coefficient equal to the following expression:


       
n n n n
+3 +3 + .
k k−1 k−2 k−3

3n

4. Prove, by a combinatorial argument, that for all positive integers n, the number n,n,n is divisible by
6.

5. Evaluate the sum        


1 n 1 n 1 n 1 n
1− + − + · · ·(−1)n .
2 1 3 2 4 3 n+1 n

6. Give a combinatorial proof of


n  
X n2
k = n(n + 1)2n−2 .
k
k=1

Hint: Find the number of ways of choosing a committee and its chairman and treasurer from n people,
where the same person could hold both positions, in two different ways.

7. Find the generating function for the sequence hn = n3 .




8. Prove that
n
3n + (−1)n
 
X n k
2 = .
k 2
k=0
k even

9. Prove that for all positive integers 0 ≤ k ≤ n, the equality


k    
X n i n−1
(−1) = (−1)k
i=0
i k

holds.

You might also like