This is an interactive website to help you learn how to write an induction proof. You should try to prove the statement yourself, and use the information on this webpage to check your work or to get a hint if you need one.

We will prove an inequality. You will prove the similar inequalities in your homework. You can see that most of the proof is missing. Click on the box on the left to reveal the next step.

But before you click, try to write the proof yourself and figure out what will appear!

If you wish to make the text disappear again, refresh the page.

Prove that $$3k+2 \le k^3$$ for all $$k \in \mathbb N,\ k\ge 2$$.

Proof: We can see that $$3(2)+2 \le 2^3$$, so assume that $$3k+2 < k^3$$ for some $$k\ge 2$$. Note also that $$k\ge 2$$ implies that $$3k^2 + 3k >6>2$$. Continuing, we compute (start by clicking on the $$3(k+1)+2$$)

We can also begin with the induction assumption (after the basis step of course!) and continue with valid operations. We assume that $$3k+2 < k^3$$ for some $$k\ge 2$$, and obtain (click on the implications to see the next step)

Thus $$3k+2 \le k^3$$ for all $$k \in \mathbb N,\ k\ge 2$$.