SOLUTION: prove that n^n<=(2n)!

SOLUTION: prove that n^n<=(2n)!

Algebra.Com

Question 393726: prove that n^n<=(2n)!
Answer by robertb(5830) (Show Source): You can put this solution on YOUR website!
The inequality is NOT true. (In fact, it might as well be .)

RELATED QUESTIONS
prove that P(n,n) = 2P(n,n � 2) and prove that C(2n,2) = 2C(n,2) + n^2 . (answered by robertb)

Prove that 2C(2n − 1,n) = C(2n,n) for all n >... (answered by greenestamps)

Prove by induction that 2^n>2n gor every positive integer n>2. (answered by ikleyn)

Prove that {{{6/(n+1) <= 6/(2n+1) +sqrt(sum(1/k^2, k=1,n))}}} for {{{n >=... (answered by Edwin McCravy)

Pls help USE MATHEMATICAL INDUCTION TO PROVE THAT (n+1)^n < 2n^2 for all natural... (answered by ikleyn)

Prove that (2n+1)^2 - (2n-1)^2 is a multiple of 8 for all positive integer values of n. (answered by ikleyn)

use mathematical induction to prove that 1^2 + 2^2 + 3^2 +...+ n^2 = n(n+1)(2n+1)/6... (answered by solver91311)

prove that for all positive integers n, sigma(2n) is greater than 2*sigma (n) (where... (answered by richard1234)

Prove by induction that 3^n ≥ 2n +1 for all positive... (answered by josgarithmetic)