Find the largest number $N$ such that: $$\sum_{n=5}^{N}{\frac{1}{n(n-2)}}<\frac{1}{4}$$
This was a question I came across while looking over local competition papers. It doesn't seem to follow any arithmetic or geometric sequence which I first thought of when first reading the problem.
So, I'm at a loss. How do you solve this?
Note that
$$ \frac1{n-2}-\frac1n=\frac2{n(n-2)}\;. $$
Thus, if you collect the even terms and the odd terms, most of the summands cancel (this is called “telescoping”), only one term involving $N$ remains in each partial sum, and you can get a simple inequality for $N$.