SOLUTION: Show that (1/((1)^(1/2))) + (1/((2)^(1/2)))+(1/((3)^(1/2)))+....+(1/((n)^(1/2)))<2(n)^(1/2) for all positive integers.
Algebra.Com
Question 30466: Show that (1/((1)^(1/2))) + (1/((2)^(1/2)))+(1/((3)^(1/2)))+....+(1/((n)^(1/2)))<2(n)^(1/2) for all positive integers.
Answer by khwang(438) (Show Source): You can put this solution on YOUR website!
Should be easy by Math Induction, since your term of the right hand
side may have mistake(too big) that I cannot solve for you here.
Kenny
RELATED QUESTIONS
show that 1(1!)+2(2!)+3(3!)+...+n(n!)= (n+1)!-1 for all positive integers... (answered by venugopalramana)
Prove that for all positive integers n,... (answered by Edwin McCravy)
Show that 1/sqrt 1 + 1/sqrt 2 + 1/sqrt 3...+ 1/sqrt n < 2*sqrt n for all positive... (answered by venugopalramana)
Show that |(-1)^(n+1) - (-1)^(n+2)| =... (answered by Alan3354)
Show that... (answered by jim_thompson5910)
Prove that (n+1)! >2 n for all n>1.
(answered by rothauserc)
-2(n+1)-3<1 (answered by cathieb1225)
Find all positive integers n such that 𝑛 2 + 1 is divisible by n+... (answered by MathLover1)
use mathematical induction to prove that
1^2 + 2^2 + 3^2 +...+ n^2 = n(n+1)(2n+1)/6... (answered by solver91311)