This document discusses mathematical induction as a method of proof. It explains that induction has three parts: the base case, the inductive hypothesis, and the inductive step. The base case shows that the statement holds true for the first relevant element. The inductive hypothesis assumes the statement holds true for an arbitrary element k. The inductive step then shows that if the statement holds true for k, it must also hold true for k+1. The document provides examples of proofs by induction, such as showing the sum of the first n odd integers is n^2. It emphasizes that induction only proves statements, it does not generate answers. The key idea is to manipulate the inductive step so it can substitute part of the induct