Proofs by induction are a fundamental tool in any discrete mathematician's toolkit. This lecture guides you through several inductive proofs and then introduces geometric proof, also known as proof without words, and combinatorial proof. You see how all three techniques can prove properties of Pascal's triangle and Fibonacci numbers.