One of the most common mistakes I see in induction proofs is assuming the recursive case and working backwards towards the induction hypothesis. This may be fine for formulas that are symmetric like those involving equality, but this way of proving induction fails if not. This post will show such example.
## Question
Prove $x - 1 \ge \frac{x}{2}$ for $x \in \mathbb{Z}^+$
## Base Case
Let $x = 1$. Then,
$$
\begin{align*}
1 -1 &\ge \frac{1}{2} \\\\
0 &\ge 0 \checkmark
\end{align*}
$$
The right side simplifies to zero since we're doing integer division.
## Recursive Case (Correct)
Let us assume the induction hypothesis, that is, $x_n - 1 \ge \frac{x_n}{2}$. We will show that $x_{n + 1} - 1 \ge \frac{x_{n + 1}}{2}$.