Proof

Question 1

What is induction proof? and what are the steps?

Answer 1

Induction is a technique of proving a statement, theorem or formula which is thought to be true, for each and every natural number n.

Step 1: Base case - prove that n = 1
formula n=n(n+1)/2

step 2: Induction - if we’ve proved it works for the base case then it must be true for every other natural number so it would be k(k+1)
formula k= k(k+1)/2
For step 2 we don’t need to prove ‘1+2+3+….+K’ as we proved it in the base case. So we’ll add it to the new part we’re trying to prove.