Saturday, 22 February 2014

algebra precalculus - Prove that 2sqrtnsqrtn+1<2n+1 for all positive integers.



I've been testing this with many values and it seems to always be true. I've been trying to rework the inequality into a form where it's much more obvious that the left hand side is always less than the right, but can't seem to do it. Can anyone help me out here?




Thanks.


Answer



2nn+1=4n2+4n<4n2+4n+1=2n+1.


Note. This inequality holds for every non-negative real n (not only integer.)


No comments:

Post a Comment

real analysis - How to find limhrightarrow0fracsin(ha)h

How to find limh0sin(ha)h without lhopital rule? I know when I use lhopital I easy get $$ \lim_{h\rightarrow 0}...