Results 1 to 5 of 5

Math Help - Sum with binomial coefficient

  1. #1
    RSF
    RSF is offline
    Newbie
    Joined
    Aug 2011
    Posts
    3

    Sum with binomial coefficient

    Trying to solve this sum, wich involves binomial coefficient. But it looks very difficult:

    \sum_{n=1}^{M-1}\left(\begin{array}{cc}M\\n\end{array}\right) \sqrt{\frac{M-n}{n}}

    It is the same as:

    \sum_{n=1}^{M-1}\left(\begin{array}{cc}M\\n\end{array}\right) \sqrt{\frac{n}{M-n}}

    Thanks
    Follow Math Help Forum on Facebook and Google+

  2. #2
    MHF Contributor
    Joined
    Aug 2007
    From
    USA
    Posts
    3,111
    Thanks
    2

    Re: Sum with binomial coefficient

    Do you believe it to be bounded? Either of them?
    Follow Math Help Forum on Facebook and Google+

  3. #3
    RSF
    RSF is offline
    Newbie
    Joined
    Aug 2011
    Posts
    3

    Re: Sum with binomial coefficient

    Comparing with:
    \sum_{n=1}^{M-1}\left(\begin{array}{cc}M\\n\end{array}\right)(M-n)=M2^{(M-1)}-2

    one finds:

    S=\sum_{n=1}^{M-1}\left(\begin{array}{cc}M\\n\end{array}\right) \sqrt{\frac{M-n}{n}} <M2^{(M-1)}-2

    if M>2

    and for M>4 it looks like this sum is

    S>2^M


    so

    2^M<S<M2^{(M-1)}-2

    for M>4
    Follow Math Help Forum on Facebook and Google+

  4. #4
    MHF Contributor

    Joined
    Aug 2006
    Posts
    18,711
    Thanks
    1640
    Awards
    1

    Re: Sum with binomial coefficient

    When I first read the post, I did not think it was true.
    After using a computer algebra to check many cases, I convinced myself it is true. I think the should be done by induction. But I have not found the identity needed to make it work.
    Follow Math Help Forum on Facebook and Google+

  5. #5
    RSF
    RSF is offline
    Newbie
    Joined
    Aug 2011
    Posts
    3

    Re: Sum with binomial coefficient

    Thanks TKHunny for your question, it has been usefull to establish limits to the possible outcome of the sum.
    Thanks Plato for getting intrested.
    Both sums are exactly the same, it requires some algebra to show this:

    \sum_{n=1}^{M-1}\left(\begin{array}{cc}M\\n\end{array}\right) \sqrt{\frac{n}{M-n}} = \sum_{n=1}^{M-1}\left(\begin{array}{cc}M\\n\end{array}\right) \sqrt{\frac{M-n}{n}}

    The question I cannot answer is expresing the sum (either of them, as they are the same) as a more compact function of M, for example:

    \sum_{n=0}^{M }\left(\begin{array}{cc}M\\n\end{array}\right) =2^M
    Follow Math Help Forum on Facebook and Google+

Similar Math Help Forum Discussions

  1. Binomial Coefficient
    Posted in the Math Challenge Problems Forum
    Replies: 5
    Last Post: August 15th 2010, 08:50 AM
  2. binomial coefficient.
    Posted in the Algebra Forum
    Replies: 3
    Last Post: May 12th 2010, 10:30 PM
  3. Binomial Coefficient
    Posted in the Discrete Math Forum
    Replies: 1
    Last Post: November 1st 2009, 05:37 PM
  4. Binomial Theorem or Binomial Coefficient
    Posted in the Pre-Calculus Forum
    Replies: 3
    Last Post: October 2nd 2009, 01:06 PM
  5. Binomial Coefficient
    Posted in the Algebra Forum
    Replies: 4
    Last Post: October 27th 2007, 04:35 AM

Search Tags


/mathhelpforum @mathhelpforum