proof by induction Flashcards
1
Q
steps for proof by induction
A
true n=1
assume true n=k
prove true n=k+1
conclusion
2
Q
proof by induction conclusion
A
assuming n=k is true
shown true n=1 n=k+1
so true all positive integers of n
3
Q
how to do division n=k+1 for proof by induction
A
fk+1 - f(k) = blah blah blha
answer + f(k)
answer divisible and f(k) divisible
therefore f(k+1) divisible