I know all of you are thinking: Man! I’m totally going to miss finite math and all of these counting problems over spring break!

Well never fear! Here are some additional practice problems. Hand in these problems 5 minutes before class on Tuesday March 15 (or via email) to receive up to 10 extra credit points toward your quiz grade.

- (
*5 points)*Verify that the formula satisfies Pascal’s Indentity. In your solution, do not plug in numbers for n and r. (Hint: A small example may be helpful–check out your lecture notes from Tuesday March 1.)

For the next two problems you will use the Binomial Theorem which says:

So for example, .

- (
*2.5 points*) Use the Binomial Theorem to show that the number of all subsets of the set {1,2,…,n} is . (Hint: problem number 5 from the practice problems for Pascal’s Triangle may be helpful.) - (
*2.5 points*) Use the Binomial Theorem to show that the alternating sum of each row of Pascal’s Triangle is zero. (Hint: problem number 6 from the practice problems for Pascal’s Triangle may be helpful.)