I want to prove this simple fact:
$\frac{n}{n+1} \geq \frac{1}{2}$ for all $n\in \mathbb{N}$.
Would this suffice: Proof by induction:
Base case: let $n = 1$, we have the result.
Inductive step: assume that for some $k\in \mathbb{N}$ we have $\frac{k}{k+1}\geq \frac{1}{2}$, we want to show that $\frac{k+1}{k+2}\geq \frac{1}{2}$.
Since $\frac{k}{k+1}\geq \frac{1}{2}$ we have that $2k\geq k+1$ iff $k\geq 1$. Thus, $k\geq 1$ and then $2k+2\geq k+2$, which simplifies to $\frac{k+1}{k+2}\geq \frac{1}{2}$. We are able to divide by these expressions as they are always positive.