Yr1 Proof by Induction

Question 1

Conclusion

Answer 1

If the statement is true for n=k, then it has been shown true for n=k+1 and as it is true for n=1, the statement is true for all n positive integers.

Question 2

For divisibility, f(k+1)

Answer 2

manipulate and split the terms until you have a multiple of f(k) and the addition is the divisible you are trying to prove.

Question 3

For recurrance relations

Answer 3

Base Case: n=1 and n=2
Assume: n=k and n=k+1
Prove: n=k+2