Ask a New Question

Question

Prove the inequality for the indicated integer values of n.
n! > 2n, n ≥ 4
8 years ago

Answers

Steve
I assume you mean

n! > 2^n

4! > 2^4
for n>4,
n! = 4!*5*6*...*n > 2^4*2*2*2...*2
8 years ago

Related Questions

prove triangular inequality: if P,Q, and R are not collinear, then PQ + QR is greater than PR. prove that 1+x < e^x < 1+ xe^x for x>0 using the mean value theorem A) How do you prove that if 0(<or=)x(<or=)10, then 0(<or=)sqrt(x+1)(<or=)10? B) So once that is f... A) How do you prove that if 0(<or=)x(<or=)10, then 0(<or=)sqrt(x+1)(<or=)10? B) So once that is f... A) How do you prove that if 0(<or=)x(<or=)10, then 0(<or=)sqrt(x+1)(<or=)10? B) So once that is f... A) How do you prove that if 0(<or=)x(<or=)10, then 0(<or=)sqrt(x+1)(<or=)10? B) So once that is f... prove the inequality sin x + tan x > 2x for x ¸ (0, pi/2) i don't know what i must do with this eq... IF A+B+C=Π prove that sin(3A)+sin(3B)+sin(3C)=-4cos(3A÷2)cos(3B÷2)cos(3C÷2) Prove the triangle inequality for Lebesgue outer measure Max is trying to prove to his friend that two reflections, one across the x-axis and another across...
Ask a New Question
Archives Contact Us Privacy Policy Terms of Use