8653073
Descrição
Notas por Alex Burden, atualizado more than 1 year ago
|
Criado por Alex Burden
aproximadamente 7 anos atrás
|
|
Página 1
Induction is a powerful way of proving known results.
Method Let P˅n be the statement to be proved Assume that the result works for n=k i.e. P˅k is true Then show the result works for n=k+1 Show the result works for n=1 i.e. P˅1 is true
NB: If P˅k is divisible by n ⇒ P˅k=nxADo not expand brackets in algebra unless absolutely necessary - Look for common factors first!
Quer criar suas próprias Notas gratuitas com a GoConqr? Saiba mais.