Strong Mathematical induction

Strong Mathematical Induction is an algebraic method to prove some statement or expression true by using contradiction method. According to this method we assume a hypothesis in starting which has to be proved wrong by the end of complete calculation. So to prove your induction to be true considered statement must be satisfied by at least one number. Each step of Mathematical Induction Problems are to be proved using mathematical formulas.
Let us consider an example of mathematical induction as i² >= 2i where i = 2, 3, 4 and so on. To start with consider your induction hypothesis that you want to prove. If i² >= 2i is true then it should be true for i = k also, where k = 2, 3, 4 and so on. So, we can write above equation as:
 k² >= 2k. Therefore if it is true for i = k we must now prove our hypothesis true for i = k + 1 also. This is the step where you actually prove your hypothesis wrong by contradiction by performing certain mathematical calculations. So, problem can be written as:
 i = k + 1 then (k + 1)² >= 2 (k + 1) for every (k + 1) = 2, 3, 4 and so on.
(k + 1)² >= 2 (k + 1),
k² + 2k + 2 >= 2k + 2,
We know k = i and i² = 2i so k² = 2k.
2k + 2k + 2 >= 2k + 2,
We know 2k > 1 because k > 1,
2k + 2k + 1 > 2k + 2.
Thus we see here that left side comes out to be greater than right side which proves our induction by contradicting the situation.