Quantcast

A community for students. Sign up today!

Here's the question you clicked on:

55 members online
  • 0 replying
  • 0 viewing

shubhamsrg

  • 2 years ago

how to prove n! ≤ ( (n+1)/2 )^n for n≥ 1

  • This Question is Closed
  1. badreferences
    • 2 years ago
    Best Response
    You've already chosen the best response.
    Medals 1

    Maybe I'm wrong, but I was under the impression that factorials are defined only for \([0,\infty)\). So isn't it just a case of demonstrating the conjecture for \(0,1\)? I barely recall reading a paper about evaluating negative factorials with the gamma function, but that was entirely on the complex plane (IIRC).

  2. shubhamsrg
    • 2 years ago
    Best Response
    You've already chosen the best response.
    Medals 2

    ohh lol..sorry..it should be >= sign,,wait i'll edit the ques..

  3. shubhamsrg
    • 2 years ago
    Best Response
    You've already chosen the best response.
    Medals 2

    done now..

  4. badreferences
    • 2 years ago
    Best Response
    You've already chosen the best response.
    Medals 1

    Lemme dust off my real analysis textbook... ahaha...

  5. sauravshakya
    • 2 years ago
    Best Response
    You've already chosen the best response.
    Medals 1

    n! = 1*2*3*...*(n-2)*(n-1)*n Now, (1+n/2) = (2+n-1)/2 = (3+n-2)/2

  6. sauravshakya
    • 2 years ago
    Best Response
    You've already chosen the best response.
    Medals 1

    (1+n/2) = (2+n-1)/2 = (3+n-2)/2 ==== (1+n)/2 Also, n! has n number of terms..... so there will be around half number of (1+n)/2 terms..... and also, ( (n+1)/2 )^n has n number of terms.. Thus, n! ≤ ( (n+1)/2 )^n

  7. sauravshakya
    • 2 years ago
    Best Response
    You've already chosen the best response.
    Medals 1

    I hope I made it clear

  8. shubhamsrg
    • 2 years ago
    Best Response
    You've already chosen the best response.
    Medals 2

    sorry didnt get it :|

  9. sauravshakya
    • 2 years ago
    Best Response
    You've already chosen the best response.
    Medals 1

    @shubhamsrg

  10. sauravshakya
    • 2 years ago
    Best Response
    You've already chosen the best response.
    Medals 1

    where didnt u understand

  11. sauravshakya
    • 2 years ago
    Best Response
    You've already chosen the best response.
    Medals 1

    n! = 1*2*3*...*(n-2)*(n-1)*n

  12. sauravshakya
    • 2 years ago
    Best Response
    You've already chosen the best response.
    Medals 1

    right? @shubhamsrg

  13. shubhamsrg
    • 2 years ago
    Best Response
    You've already chosen the best response.
    Medals 2

    so there will be around half number of (1+n)/2 terms..... + conclusion part..

  14. shubhamsrg
    • 2 years ago
    Best Response
    You've already chosen the best response.
    Medals 2

    yes..following..

  15. sauravshakya
    • 2 years ago
    Best Response
    You've already chosen the best response.
    Medals 1

    Now, take 1 and n and average them

  16. shubhamsrg
    • 2 years ago
    Best Response
    You've already chosen the best response.
    Medals 2

    okay,,1+n /2..

  17. sauravshakya
    • 2 years ago
    Best Response
    You've already chosen the best response.
    Medals 1

    So, u will get (n+1)/2 right?

  18. shubhamsrg
    • 2 years ago
    Best Response
    You've already chosen the best response.
    Medals 2

    n/2 ..

  19. sauravshakya
    • 2 years ago
    Best Response
    You've already chosen the best response.
    Medals 1

    u will again get (n+1)/2 right?

  20. shubhamsrg
    • 2 years ago
    Best Response
    You've already chosen the best response.
    Medals 2

    maybe you meant 2 and n-1 ?

  21. shubhamsrg
    • 2 years ago
    Best Response
    You've already chosen the best response.
    Medals 2

    yes,then avg n+1 /2

  22. sauravshakya
    • 2 years ago
    Best Response
    You've already chosen the best response.
    Medals 1

    oh...... 2 and (n-1)

  23. sauravshakya
    • 2 years ago
    Best Response
    You've already chosen the best response.
    Medals 1

    got it?

  24. shubhamsrg
    • 2 years ago
    Best Response
    You've already chosen the best response.
    Medals 2

    okay,,i get that part..

  25. shubhamsrg
    • 2 years ago
    Best Response
    You've already chosen the best response.
    Medals 2

    buzz ?

  26. mukushla
    • 2 years ago
    Best Response
    You've already chosen the best response.
    Medals 2

    check saura's method and also this go by mathematical induction... Use this :\[2\le (\frac{n+2}{n+1})^{n+1}\]

  27. sauravshakya
    • 2 years ago
    Best Response
    You've already chosen the best response.
    Medals 1

    guys I think I was totally wrong

  28. sauravshakya
    • 2 years ago
    Best Response
    You've already chosen the best response.
    Medals 1

    But got the method to solve this

  29. shubhamsrg
    • 2 years ago
    Best Response
    You've already chosen the best response.
    Medals 2

    am all years..

  30. shubhamsrg
    • 2 years ago
    Best Response
    You've already chosen the best response.
    Medals 2

    ears **

  31. shubhamsrg
    • 2 years ago
    Best Response
    You've already chosen the best response.
    Medals 2

    @mukushla didnt get you.. @sauravshakya your method ?

  32. mukushla
    • 2 years ago
    Best Response
    You've already chosen the best response.
    Medals 2

    go on saurav

  33. shubhamsrg
    • 2 years ago
    Best Response
    You've already chosen the best response.
    Medals 2

    here's what i tried to do.. (n+1)/2 = n/2 + 1/2 now for even n, n/2 + 1 > (n+1)/2 > n/2 (n/2 + 1) (n/2 + 2) > ((n+1)/2)((n+1)/2) > (n/2) (n/2 -1) . . . . (n/2 +1)(n/2 +2)......(n/2 + n/2) > ((n+1)/2 )^(n/2) > (n/2) (n/2 -1).....(n/2 -n/2) n! / (n/2) ! > ((n+1)/2 )^(n/2) > (n/2) ! is this any help? how can we take it further ?

  34. ravimeena
    • 2 years ago
    Best Response
    You've already chosen the best response.
    Medals 0

    take n=2 so n!=2 and (3/2)^2=2.25 so 2<2.25 hence proved

  35. shubhamsrg
    • 2 years ago
    Best Response
    You've already chosen the best response.
    Medals 2

    well thats ofcorse not a general soln..

  36. mukushla
    • 2 years ago
    Best Response
    You've already chosen the best response.
    Medals 2

    u got n! / (n/2) ! > ((n+1)/2 )^(n/2) how can we match this with original inequality?

  37. shubhamsrg
    • 2 years ago
    Best Response
    You've already chosen the best response.
    Medals 2

    you're the expert,,you telll!! :P

  38. mukushla
    • 2 years ago
    Best Response
    You've already chosen the best response.
    Medals 2

    lol...idk if it will help or not.

  39. shubhamsrg
    • 2 years ago
    Best Response
    You've already chosen the best response.
    Medals 2

    what were you saying about induction?

  40. mukushla
    • 2 years ago
    Best Response
    You've already chosen the best response.
    Medals 2

    well for \(n=1\) its true... let suppose\[n! \le (\frac{n+1}{2})^n \]be a true statement...we just need to prove\[(n+1)! \le (\frac{n+2}{2})^{n+1} \]

  41. shubhamsrg
    • 2 years ago
    Best Response
    You've already chosen the best response.
    Medals 2

    hmm

  42. mukushla
    • 2 years ago
    Best Response
    You've already chosen the best response.
    Medals 2

    \[(n+1)!=(n+1).n! \le (n+1).(\frac{n+1}{2})^{n}\le \frac{n+1}{2}(\frac{n+2}{n+1})^{n+1}.(\frac{n+1}{2})^{n}=(\frac{n+2}{2})^{n+1} \]

  43. shubhamsrg
    • 2 years ago
    Best Response
    You've already chosen the best response.
    Medals 2

    didnt get the second last step..?

  44. mukushla
    • 2 years ago
    Best Response
    You've already chosen the best response.
    Medals 2

    well \[1 \le \frac{1}{2} (\frac{n+2}{n+1})^{n+1}\] but u need to prove this inequality also

  45. shubhamsrg
    • 2 years ago
    Best Response
    You've already chosen the best response.
    Medals 2

    i see..

  46. shubhamsrg
    • 2 years ago
    Best Response
    You've already chosen the best response.
    Medals 2

    if we try like this : n = (n+1 /2) + (n-1 /2) n-1 = (n+1 /2) + (n-3 /2) . . . . and multiplying all, n! = (n+1 /2)^n + something.. does this help ??

  47. shubhamsrg
    • 2 years ago
    Best Response
    You've already chosen the best response.
    Medals 2

    RHS will be some polynomial or f(n+1 /2) with roots -(n-1)/2 ,-(n-3)/2 etc.. so there isnt much problem multiplying all..main problem is how to prove!! ?? !!

  48. mukushla
    • 2 years ago
    Best Response
    You've already chosen the best response.
    Medals 2

    u most prove \(\text{something} \le 0\) right?

  49. shubhamsrg
    • 2 years ago
    Best Response
    You've already chosen the best response.
    Medals 2

    yep..

  50. shubhamsrg
    • 2 years ago
    Best Response
    You've already chosen the best response.
    Medals 2

    if n+1 /2 = x, then it'll be of the form x^n + x^(n-1) (0) - x^(n-2)(something +ve) + ............... what will come in ............ ?? am quite sure about what i wrote before ...............

  51. satellite73
    • 2 years ago
    Best Response
    You've already chosen the best response.
    Medals 0

    i did not read all of the above, but is this supposed to be a proof by induction?

  52. shubhamsrg
    • 2 years ago
    Best Response
    You've already chosen the best response.
    Medals 2

    well you can use any legitimate method sir..

  53. satellite73
    • 2 years ago
    Best Response
    You've already chosen the best response.
    Medals 0

    no i messed that up, have to try again

  54. shubhamsrg
    • 2 years ago
    Best Response
    You've already chosen the best response.
    Medals 2

    people i got the solution!!

  55. shubhamsrg
    • 2 years ago
    Best Response
    You've already chosen the best response.
    Medals 2

    it was accidently,,while solving another ques,,and i recalled AM >= GM,,here's my solution

  56. shubhamsrg
    • 2 years ago
    Best Response
    You've already chosen the best response.
    Medals 2

    we know that : [ (1 + 2 +3 ..... n)/n ] ^n >= 1.2.3......n or [ n(n+1)/2n ]^n >= n! => (n+1 /2)^n >=n! lol...

  57. mukushla
    • 2 years ago
    Best Response
    You've already chosen the best response.
    Medals 2

    Neat solution

  58. shubhamsrg
    • 2 years ago
    Best Response
    You've already chosen the best response.
    Medals 2

    thanks! :)

  59. mukushla
    • 2 years ago
    Best Response
    You've already chosen the best response.
    Medals 2

    very nice man...\[\frac{1+2+...+n}{n}\ge\sqrt[n]{n!}\]

  60. Not the answer you are looking for?
    Search for more explanations.

    Search OpenStudy
    • Attachments:

Ask your own question

Ask a Question
Find more explanations on OpenStudy

Your question is ready. Sign up for free to start getting answers.

spraguer (Moderator)
5 → View Detailed Profile

is replying to Can someone tell me what button the professor is hitting...

23

  • Teamwork 19 Teammate
  • Problem Solving 19 Hero
  • You have blocked this person.
  • ✔ You're a fan Checking fan status...

Thanks for being so helpful in mathematics. If you are getting quality help, make sure you spread the word about OpenStudy.

This is the testimonial you wrote.
You haven't written a testimonial for Owlfred.