1. 10/24/2015MATH 106, Section 81 Section 8 Pascal’s Triangle Questions about homework? Submit homework!

2. 10/24/2015MATH 106, Section 82 How many ways can we choose a committee of 5 from a class of one instructor and 13 students if the committee may consist of any 5 of the 14 individuals. the committee must include the instructor. the committee must not include the instructor. C(14,5) = 2002 C(13,4) = 715 C(13,5) = 1287 Why do these two answers sum to the previous answer? #1

3. 10/24/2015MATH 106, Section 83 Pascal’s Formula Pascal observed the following: C(n, k) = C(n-1, k-1) + C(n-1, k) The number of ways to choose k items from the n items The number of ways to choose k–1 items from the n–1 items Set aside 1 “special” item leaving n–1 items. Select k items from the n items as follows: The number of ways to choose k items from the n–1 items Choose the “special” item and then choose k–1 items from the n–1 items or Do not choose the “special” item and then choose k items from the n–1 items

4. 10/24/2015MATH 106, Section 84 Pascal’s Formula Pascal observed the following: C(n, k) = C(n-1, k-1) + C(n-1, k) Let’s check it! C(5, 3) = C(7, 2) = C(6, 1) = C( ) + C( )4, 2 4, 3 10 64 C( ) + C( )6, 1 6, 2 21 615 C( ) + C( )5, 0 5, 1 6 15

5. 10/24/2015MATH 106, Section 85 Pascal’s Triangle C(0, 0) C(1, 1) C(1, 0) C(2, 0)C(2, 2)C(2, 1) C(3, 0)C(3, 2)C(3, 1) C(3, 3) C(4, 0)C(4, 2)C(4, 1)C(4, 3)C(4, 4) C(5, 0)C(5, 2)C(5, 1)C(5, 3)C(5, 4) C(5, 5) How do we compute the values? Note: The first row is row 0 (that is, n is 0).

6. 10/24/2015MATH 106, Section 86 Pascal’s Triangle C(0, 0) C(1, 1) C(1, 0) C(2, 0)C(2, 2)C(2, 1) C(3, 0)C(3, 2)C(3, 1) C(3, 3) C(4, 0)C(4, 2)C(4, 1)C(4, 3)C(4, 4) C(5, 0)C(5, 2)C(5, 1)C(5, 3)C(5, 4) C(5, 5) 1 1 1 1 1 2 1 3 3 1 1 4 64 1

7. 10/24/2015MATH 106, Section 87 Pascal’s Triangle 1 1 1 1 1 2 1 3 3 1 1 4 64 1 1 5 10 5 1 1 6 15 20 156 1 1 7 21 35 21 7 1 #2 In the Pascal’s Triangle displayed below, add the entries up to and including those corresponding to the row for n =10.

8. 10/24/2015MATH 106, Section 88 We now have two ways to calculate C(n, k) The formula from Section 5 Pascal’s Triangle Use Pascal’s Triangle to evaluate each of the following: C(6, 3)C(10, 4) C(7, 5)C(10, 6) C(8, 4)C(10, 5) 20 210 21 210 70 252 #3

9. 10/24/2015MATH 106, Section 89 Homework Hints: In Section 8 Homework Problem #5, In Section 8 Homework Problem #9(b), In Section 8 Homework Problem #10(b), you can choose to construct the triangle from the beginning, or you can choose to copy the partially constructed triangle in Section 8 of the textbook (after verifying that it is correct) and then add the required rows to complete the triangle. you can use your calculation in part (a) together with the GOOD = ALL  BAD principle. notice that there is only one way to alternate speeches and musical selection, after which the order of the speeches and the order of the musical selections must be decided.

10. 10/24/2015MATH 106, Section 810 Section 9 Binomial Expansion

11. 10/24/2015MATH 106, Section 811 Let’s take a look back … Section 7, homework problem #6 07C(7, 0) 16C(7, 1) 25C(7, 2) 34C(7, 3) 43C(7, 4) 52C(7, 5) 61C(7, 6) 70C(7, 7) H T A coin is flipped 7 times. What percent of the times will result in each of the possibilities? You must calculate the combinations for each number of heads One each flip, there are two possible outcomes. How did we figure the percentages? These match the row of Pascal’s Triangle corresponding to n = 7

12. 10/24/2015MATH 106, Section 812 What is “Binomial Expansion”? Take an expression of the form (x + y) n and multiply it out for n = 2 and for n = 3. (x + y) 2 = Before simplification, how many terms did we get? (x + y) 3 = Before simplification, how many terms did we get? (x + y)(x + y) = x 2 + yx + xy + y 2 = x 2 + 2xy + y 2 4 = 2 2 (x + y)(x + y)(x + y) = x 3 + xxy + xyx + xyy + yxx + yxy + yyx + y 3 =x 3 + 3x 2 y + 3xy 2 + y 3 8 = 2 3 RECIPE FOR CHOOSING ONE TERM IN THE EXPANSION OF (x + y) n BEFORE SIMPLIFICATION: Choose x or y from first factor and then choose x or y from second factor and then … #1

13. 10/24/2015MATH 106, Section 813 Without doing any multiplication, find the following expansion: (x + y) 7 = If we did the multiplication, how many terms would we get before simplification? x 7 + x 6 y + x 5 y 2 + x 4 y 3 + x 3 y 4 + x 2 y 5 + xy 6 + y 7 7 21 35 21 7 128 = 2 7 RECIPE FOR CHOOSING ONE TERM IN THE EXPANSION OF (x + y) 7 BEFORE SIMPLIFICATION: Choose x or y from first factor and then choose x or y from second factor and then … Observe that the coefficients in the simplified expansion of (x + y) 7 match the row of Pascal’s Triangle corresponding to 7. #2

14. 10/24/2015MATH 106, Section 814 It’s the same idea as flipping a coin 7 times… Each time we compute a term in the expansion of (x + y) 7, we choose x or y seven times in a row. Each time flip a coin seven times in a row, 7 choices of H or T are made in a row We can use Pascal’s triangle … 07C(7, 0) 16C(7, 1) 25C(7, 2) 34C(7, 3) 43C(7, 4) 52C(7, 5) 61C(7, 6) 70C(7, 7) y x (x + y) 7 = x 7 + 7x 6 y + 21x 5 y 2 + 35x 4 y 3 + 35x 3 y 4 + 21x 2 y 5 + 7xy 6 + y 7 Notice the symmetry! (x + y) 7 = x 7 + 7x 6 y + 21x 5 y 2 + 35x 4 y 3 + 35x 3 y 4 + 21x 2 y 5 + 7xy 6 + y 7 Notice the symmetry!

15. 10/24/2015MATH 106, Section 815 The Binomial Theorem (x + y) n = C(n, 0)x n y 0 + C(n, 1)x n-1 y 1 + C(n, 2)x n-2 y 2 + C(n, 3)x n-3 y 3 + … + C(n, n-2)x 2 y n-2 + C(n, n-1)x 1 y n-1 + C(n, n)x 0 y n (x + y) n = C(n, 0)x n y 0 + C(n, 1)x n-1 y 1 + C(n, 2)x n-2 y 2 + C(n, 3)x n-3 y 3 + … + C(n, n-2)x 2 y n-2 + C(n, n-1)x 1 y n-1 + C(n, n)x 0 y n (bottom of page 67 in the textbook) (x + y) n = C(n, n)x n y 0 + C(n, n-1)x n-1 y 1 + C(n, n-2)x n-2 y 2 + C(n, n-3)x n-3 y 3 + … + C(n, 2)x 2 y n-2 + C(n, 1)x 1 y n-1 + C(n, 0)x 0 y n (x + y) n = C(n, n)x n y 0 + C(n, n-1)x n-1 y 1 + C(n, n-2)x n-2 y 2 + C(n, n-3)x n-3 y 3 + … + C(n, 2)x 2 y n-2 + C(n, 1)x 1 y n-1 + C(n, 0)x 0 y n Because of symmetry, we could choose to write the formula in the Binomial Theorem as follows: