Week 6 Flashcards
Induction
if for all integers n there is a function P(n), we can prove P(n) is true if
1. P(1) is true
2 if P(n) is true, then P(n+1) is also true
How to induction
Prove P(19 by LFS = RHS
use P(n) and add n+1, then try to get the same result using P(n+1)
What if P(1) is not valid
if P(k) is true, induction can be used to prove P is true for n in N such that n is greater or equal to k
Implicit diffrentiaton
application of chain rule. Derentiate y in terms of x y ading a dy/dx factor. Solve for dy/dx
Second derivative implicit
same shit, derivaive of dy/dx is second derivative. sub in dy/dx when done
logarithmic differentiation
take natural logs of both sides, use properties of logs to make equations easier, differentiate implicitly.
Taylor series
sum to infity of (thing). expansion of the function f expressed about a in terms of only x. Mcclarin series when a=0
nth degree taylor polynomial of f about a
partialsum of taylor expansion up to n. is a polynomial of degree n
multiplication and division of series
if the taylor series for a function is known, similar functions can be multiplied by that. Te taylor expansion of a composite function is the product of the taylor functions of the composite functions.
Strong induction
if p(1), p(2), p(k) are true, then p(k+1) is true. similar to normal induction for cases whre you have to use more than one prior examples.