The Marksmith AU

The induction template on autopilot

You run base $n=1$, assume $k$, prove $k+1$ — always.

Read the range. The base case is the smallest $n$ the statement claims — it may be $5$. Check the step: a claim about odd $n$ steps by $2$.

Next time: Take the base case and step size from the question.

Try it: Work one on a block