I am given this expression and I have to prove it using mathematical induction
${\displaystyle \forall }n\ge 1 $ , $$ \sum _{k=1}^n\left(\frac{1}{\sqrt{k}}\right)\ge 2\left(\sqrt{n+1}-1\right)$$
I have proved it is true for $n=1$, then suposed it was true until $n$ and wanted to prove it was also true until $n+1$.
I have operated a bit and arrived to this expression I want to prove: $${\frac{1}{2\sqrt{n+1}}}\ge (\sqrt{n+2}-\sqrt{n+1})$$ , and I don't know how to continue to clear that inequality to prove it. Can you help me please?? (I have just started studying this method so I'm a bit lost :/ )