Learn

Congratulations on reaching the end of this lesson! Let’s recap what we have learned:

1. A mathematical proof is a mathematical explanation of whether or not a given statement is true or false.
2. Mathematical induction is a technique that proves a statement by providing one base case, assuming the statement is true for some larger integer k, then proving the statement is true for k+1 using said assumption (induction hypothesis).
3. Strong induction is a technique that proves a statement by providing more than one base case, assuming the statement is true for all integers from the largest base case to some even larger integer k, and then proving the statement is true for k+1 using that assumption (induction hypothesis).

As a final check for understanding, the checkpoint that follows will test your ability to determine which statement requires which method. A statement will be provided below, and you will type your suggested method of proof in Python.

### Instructions

1.

Statement: For all integers n,

$n \leq n^2$

Create a variable called answer and set it equal to either 'induction' (if you think this statement uses an induction proof) or 'strong' (if you think this statement requires strong induction).