Prove that $$2\sqrt{n+1}-2<\sum_{k=1}^{n}{\frac{1}{\sqrt{k}}}<2\sqrt{n}-1.$$
After playing around with the sum, I couldn't get anywhere so I proved inequalities by induction. I'm however interested in solutions that don't use induction, if there are some (relatively simple ones, since I'm high-school student).
Also any advice for determining if a sum can be written in "compact" form? For example, $\displaystyle \sum_{k=1}^{n}{(-1)^{k-1}k}$ is actually $\displaystyle-\frac{n}{2}$ for even $n$ and $\displaystyle\frac{n+1}{2}$ for odd $n$.
I’d just about bet that the inequality was derived from the observation that
$$\int_1^{n+1}\frac1{\sqrt x}dx<\sum_{k=1}^n\frac1{\sqrt k}<1+\int_1^n\frac1{\sqrt x}dx\;,$$
which can be made from a graph of $y=\frac1{\sqrt x}$ showing rectangles for the appropriate upper and lower Riemann sums.
Since $$\int x^{-1/2}dx=2x^{1/2}+C\;,$$
this immediately yields
$$2\sqrt{n+1}-2<\sum_{k=1}^n\frac1{\sqrt k}<2\sqrt n-1\;.$$
It’s a non-inductive proof, and it’s accessible to those high-school students who have had a decent calculus course.