Proof Writing & Problem Solving · Easy problem

A proof by induction of a statement $P(n)$ for all integers $n \ge 1$ has an inductive step "$P(n)$ implies $P(n + 1)$" whose argument uses the inequality $n \ge 3$. How many values of $n$ must the write-up check directly as base cases?