Waste less time on Facebook — follow Brilliant.
×

Inequalities

prove that (n!)^2 > n^n

Note by Mishti Angel
4 years ago

No vote yet
3 votes

Comments

Sort by:

Top Newest

It is false for n=1 Shourya Pandey · 4 years ago

Log in to reply

Its false for n=2 also Arnab Bhattacharya · 3 years, 1 month ago

Log in to reply

proof: let's take n=1 n! = 1! = 1 (n!)^2 = 1^2 = 1 n^n = 1^1 = 1 then 1 > 1 is false so this expression is false. /* for n=2 n! = 2 n^2 = 2^2 = 4 n^2 = 2^2 = 4 4 > 4 is false Djordje Marjanovic · 4 years ago

Log in to reply

@Djordje Marjanovic It's true for n = 3, 4, 5, ... Pi Han Goh · 4 years ago

Log in to reply

@Djordje Marjanovic Maybe Mishit think \((n!)^2\geq n^n\) Arbër Avdullahu · 4 years ago

Log in to reply

the question tht i meant is posted by arber nd the inequality holds good for n belonging to natural numbers other than 1 and 2.... we need to prove it theoritically Mishti Angel · 4 years ago

Log in to reply

×

Problem Loading...

Note Loading...

Set Loading...