<s>[INST] How to prove that $\frac{1}{n+1}+\frac{1}{n+2}+...+\frac{1}{2n} \le \frac{n}{n+1}$? I have a series $$a_n = \frac{1}{n+1}+\frac{1}{n+2}+...+\frac{1}{2n} \quad n \ge 1$$
For example, $a_3 = \frac{1}{4}+\frac{1}{5}+\frac{1}{6}$. 
I need to prove that for $n \ge 1$: 
$$a_n = \frac{1}{n+1}+\frac{1}{n+2}+...+\frac{1}{2n} \le \frac{n}{n+1}$$
I guess one could say that:
$$
\sum_{i=1}^n\frac{1}{n+i} \le \sum_{i=1}^n\frac{n}{n+1}
$$
However, I'm not sure this is rigorous enough (for example, in $\sum_{i=1}^n\frac{1}{n+i}$ how do we really know that the index goes from $1$ to $n$) and I think this needs to be proven via induction. 
So the base case is:
$$a_1 = \frac{1}{2} \le \frac{1}{2} = \frac{n}{n+1}$$
The step: suppose $a_n \le \frac{n}{n+1}$ then let's prove that $$a_{n+1} \le \frac{n+1}{n+2}$$
The above can be developed as:
$$
\frac{1}{n+1}+\frac{1}{n+3}+...+\frac{1}{2(n+1)} \le \frac{n}{n+1}+\frac{1}{n+2}
$$
This is where I get stuck. If I could somehow prove that the number of terms to the left $\le$ the terms to the left I would be golden. Or maybe there's another way.
 [/INST] HINT:
$$\dfrac1{n+1}>\dfrac1{n+r}$$  for $2\le r\le n$
</s>