MCR3U - Unit 7: Discrete Functions: Sequences and Series Date: 7.3 & 7.4 Creating Rules to Define Sequences, Recursive Sequences and Formulas 7.7 Pascal's Triangle and Binomial Expansion mework: Pages 447: #3, 5-8 Pages 466: #1, 4a, c,€), 5(ce) Pages 468-469: #5, 10, 11,17, 20 irning Objectives/Success Criteria: At the end of this lesson I will be able to: * Describe the Fibonacci and Lucas sequences, Pascal's ‘Triangle + Expand binomials using Pascal's Triangle 1. Identifying arithmetic and geometric sequences: i. Determine the type of each sequence (arithmetic, geometric, neither) where nEN . ii, Determine the general term, the recursive formula and ts. a) 15, 30,45, ..69 arinwetti —_b) 640,320, 160, ... 30 geseuetrict) 38,5, 6.2,.. anthnghe +15 re detb Las IS 2n-1) 15 a - Lo etn 415 tn =640(4) n= 38+t-y 2 Ly = 154 DIS bn= tn (2) ins bey Sha “1 bes oto (5) bE = 3.845012) 2. Fibonacci Sequence : 20 =48 Fibonacci sequence: 5, 3.13, 2! % Sumot the two prev. terms * \ C Recursive formula: tn = En-) + bn-2 Whore ceauened: 3. Lucas Sequen: Lucas sequence: Recursive formula: 13.9) 7, 11 18,29 -- bye bn etn-2 were bis 1 bi-3 HEN, n>Z 4. Pascal's Triangle: 1 Properties: Se "oe © Istdiagonal: constant # ail “I Vv é © 20 diagonal: arithwettc tn= 1 \ * counting #9" Se ° 3rd XN , g ss Sn iL 3 diagonal: triangulav + ie 4 [ os 10) A, | 4 , oN fw YoNeE A ) Ds ‘ 2 5 6 I Za za 3 ° ° Yer 45%Why is this useful? Fibonacci Sequence: sum of the “Shallow Agama” Binomial expansion: (x+y = xP 4 Boy + y* (yf 2 de axty + Sxyta ys (ery) = xbe 4x8 ox yt ax y3e yt Whar's the pattern with the terms? Expand (x) cooktiitentaatram Pascal's trangle 4aytle aye! Avro Aye tr the wt voy 2 = UG) bP a a (BY b's 0 (G) b+ ala) b 4 o (sypea sree Myleamytecn tymentye | LD Bt Ab + Zar + Sanda pt Lyporantoon x starbat mana \ at 3 3 4 startak O ana T What happens if there is a negative term? Expand (x-3)’: ~ include the wacetive Mi the = eae waite)! 4 2x8 2) + 35(x4)(-3)3 + bracket ong vaise to the 3543(-3)4 e21 e*-ay + FxGay + (-3)7 PFO PT .ake Pxponont KPH 2x6 4 des —que 4 + 2g35Ks ~S105K7 +5108 x - 2189 How do you find the coefficients if you don’t know the previous row? Combinations: a way of selecting several things out of a larger group where the order doesn’t matter ( : ) in words > n choose k Expand (x+y): Ifyou have 11 presents, how many different combinations can you get if you choose k presents? (S)agpe (ea Ede Chey ee Oey Gy ( oy (a )ey Ce xegt (ra)xy® + Gi} xey 5 x Wye Soxty* + ‘8 Byse szox7yt + HDX? 5 + H2% 4? + BBO xt FT TAS AES + BS yay eM yy! ey”