https://padlet.com/dglkevinlee01/wecxlvt35nu7 Sections 12.5, 12.6, 12.7, 12.9 en-us 2019-04-15 17:20:38 UTC 2025-04-01 17:22:05 UTC hello@padlet.com dglkevinlee01 https://padlet.com/dglkevinlee01/wecxlvt35nu7/wish/351739703 A series can be represented in a compact form.
The Greek capital letter, ∑ , is used to represent the sum. The series 4+8+12+16+20+24 can be expressed as 6∑n=14n .
The expression is read as the sum of 4n as n goes from 1 to 6 .]]> 2019-04-15 17:20:38 UTC https://padlet.com/dglkevinlee01/wecxlvt35nu7/wish/351739703 dglkevinlee01 https://padlet.com/dglkevinlee01/wecxlvt35nu7/wish/351739704 2019-04-15 17:20:38 UTC https://padlet.com/dglkevinlee01/wecxlvt35nu7/wish/351739704 dglkevinlee01 https://padlet.com/dglkevinlee01/wecxlvt35nu7/wish/351739705 Expand a series from sigma notation (plug in the first n value to the formula and keep increasing by 1).
Find a finite sum using calculator.
Find an infinite sum using formula  S=a1/(1-r)
Go from a series to the sigma notation.]]> 2019-04-15 17:20:38 UTC https://padlet.com/dglkevinlee01/wecxlvt35nu7/wish/351739705 dglkevinlee01 https://padlet.com/dglkevinlee01/wecxlvt35nu7/wish/351739706 Make sure to keep increasing by one.]]> 2019-04-15 17:20:38 UTC https://padlet.com/dglkevinlee01/wecxlvt35nu7/wish/351739706 dglkevinlee01 https://padlet.com/dglkevinlee01/wecxlvt35nu7/wish/351739710 Get sigma on calculator for finite sums: Math button, then press Zero]]> 2019-04-15 17:20:38 UTC https://padlet.com/dglkevinlee01/wecxlvt35nu7/wish/351739710 dglkevinlee01 https://padlet.com/dglkevinlee01/wecxlvt35nu7/wish/351739711 Pascal's triangle
Expanding a binomial (all terms)
Finding a particular term in binomial expansion.]]> 2019-04-15 17:20:38 UTC https://padlet.com/dglkevinlee01/wecxlvt35nu7/wish/351739711 dglkevinlee01 https://padlet.com/dglkevinlee01/wecxlvt35nu7/wish/351739714 2019-04-15 17:20:38 UTC https://padlet.com/dglkevinlee01/wecxlvt35nu7/wish/351739714 dglkevinlee01 https://padlet.com/dglkevinlee01/wecxlvt35nu7/wish/351739715 (2x-y)^6
64x^6-192x^5y+240x^4y^2-160x^3y^3+60x^2y^4-12xy^5+y^6

]]> 2019-04-15 17:20:38 UTC https://padlet.com/dglkevinlee01/wecxlvt35nu7/wish/351739715 dglkevinlee01 https://padlet.com/dglkevinlee01/wecxlvt35nu7/wish/351739716 Make sure to start with k = something to the n.]]> 2019-04-15 17:20:38 UTC https://padlet.com/dglkevinlee01/wecxlvt35nu7/wish/351739716 dglkevinlee01 https://padlet.com/dglkevinlee01/wecxlvt35nu7/wish/351739717 When you calculate make sure you multiply the numbers on the pascal's number too.]]> 2019-04-15 17:20:38 UTC https://padlet.com/dglkevinlee01/wecxlvt35nu7/wish/351739717 dglkevinlee01 https://padlet.com/dglkevinlee01/wecxlvt35nu7/wish/351739718 A description of the operation of adding infinitely many quantities, one after the other, to a given starting quantity.]]> 2019-04-15 17:20:38 UTC https://padlet.com/dglkevinlee01/wecxlvt35nu7/wish/351739718 dglkevinlee01 https://padlet.com/dglkevinlee01/wecxlvt35nu7/wish/351739720 2019-04-15 17:20:38 UTC https://padlet.com/dglkevinlee01/wecxlvt35nu7/wish/351739720 dglkevinlee01 https://padlet.com/dglkevinlee01/wecxlvt35nu7/wish/351739721 First five terms of the exponential series. E^2.03
E^2.03=1+2.03+2.03^2/2 + 2.03^3/3! + 2.04^4/4!
=7.19]]> 2019-04-15 17:20:38 UTC https://padlet.com/dglkevinlee01/wecxlvt35nu7/wish/351739721 dglkevinlee01 https://padlet.com/dglkevinlee01/wecxlvt35nu7/wish/351739723 On e^x problems, don't round along the way.]]> 2019-04-15 17:20:38 UTC https://padlet.com/dglkevinlee01/wecxlvt35nu7/wish/351739723 dglkevinlee01 https://padlet.com/dglkevinlee01/wecxlvt35nu7/wish/351739724 Make sure to use correct sign and numbers on the calculator otherwise, the result will be wrong ]]> 2019-04-15 17:20:38 UTC https://padlet.com/dglkevinlee01/wecxlvt35nu7/wish/351739724 dglkevinlee01 https://padlet.com/dglkevinlee01/wecxlvt35nu7/wish/351739725 A mathematical proof technique.
It is essentially used to prove that a property P(n) holds for every natural number n, i.e. for n = 0, 1, 2, 3, and so on.
The method of inductionrequires two cases to be proved.]]> 2019-04-15 17:20:38 UTC https://padlet.com/dglkevinlee01/wecxlvt35nu7/wish/351739725 dglkevinlee01 https://padlet.com/dglkevinlee01/wecxlvt35nu7/wish/351739727 2019-04-15 17:20:38 UTC https://padlet.com/dglkevinlee01/wecxlvt35nu7/wish/351739727 dglkevinlee01 https://padlet.com/dglkevinlee01/wecxlvt35nu7/wish/351739728 Series proof.
Divisibility proof.
Use 3 steps of induction.
Show n=1 works.
Assume n=k works.
Show n=k+1 works.]]> 2019-04-15 17:20:38 UTC https://padlet.com/dglkevinlee01/wecxlvt35nu7/wish/351739728 dglkevinlee01 https://padlet.com/dglkevinlee01/wecxlvt35nu7/wish/351739729 Make sure to check the both formula is correct after following steps.]]> 2019-04-15 17:20:38 UTC https://padlet.com/dglkevinlee01/wecxlvt35nu7/wish/351739729 dglkevinlee01 https://padlet.com/dglkevinlee01/wecxlvt35nu7/wish/351739732 We don't have to use the calculator but be careful with distributing those number correctly. ]]> 2019-04-15 17:20:38 UTC https://padlet.com/dglkevinlee01/wecxlvt35nu7/wish/351739732