The Marksmith AU

Induction as the safe answer

You see an $n$ and reach for induction.

An $n$ is not the signal. The signal is a recurrence, or "for all integers $n \ge$ …" with no other route in. Induction cannot disprove a claim; a counterexample does.

Next time: Before "assume true for $n=k$", try substituting an earlier result.

Try it: Work one on a block