Proof by induction

Question 1

step 1

Answer 1

test for n=1 therefore true for n=1
check lhs and rhs

Question 1

step 2

Answer 1

test for n=k

Question 2

step 3

Answer 2

use n=k+1 and rearrange to prove that it is true

Question 3

step 4

Answer 3

conclusion
Since true for n=1 and if true for n=k then true for n=k+1 therefore true for all positive integer values of n

Question 4

Types of questions

Answer 4

prove it is divisible by …
prove the series continues…
Summation of series
matrix multiplication
recurrance relations