1. Not finding help here? Sign up for a free 30min tutor trial with Chegg Tutors
    Dismiss Notice
Dismiss Notice
Join Physics Forums Today!
The friendliest, high quality science and math community on the planet! Everyone who loves science is here!

Combinatorial argument probabilities

  1. Feb 8, 2015 #1
    Hello
    1. The problem statement, all variables and given/known data

    Consider fk N*→N, k≥0
    fk(n)=Σ jk n>0

    We're looking to establish these identities, using a combinatorial argument
    fk(n)=n if k=0
    fk(n)= 1/(k+1) [ nk+1 + Σ ( i , k+1) (-1)k+1-ifi(n) ] if k>0
    the sum is about i from i=0 to i=k-1 and (i, k+1) is the combination.

    Consider the experience of k+1 drawing with handoff from a box of n balls numbered
    Ej : the maximum of the values obtained on the k+1 draw is j , j=1,......,n
    Fj : The drawing are made on {1,.....,j} j=1,....,n
    Fo= vide.gif

    1. Find |Ω|
    2. Write Ω as an operation on sets E1,....,En
    3. Write Ej as an operation on sets Fj-1, Fj j=1....n
    4. Find |Fj| j=0....n
    5. Find |Ej| j=1....n
    6. Find |Ω| through the calculation of |Ej| j=1...n and using the binomial theorem
    2. Relevant equations
    (x+y)n=∑(k, n)xn-kyk

    3. The attempt at a solution

    1. |Ω|=nk+1
    2. Ω=∩ Ej for j=1,....,n
    3. I just don't get what Fj represents..? :oldconfused:

    Thanks
     
  2. jcsd
  3. Feb 14, 2015 #2
    Thanks for the post! This is an automated courtesy bump. Sorry you aren't generating responses at the moment. Do you have any further information, come to any new conclusions or is it possible to reword the post?
     
Know someone interested in this topic? Share this thread via Reddit, Google+, Twitter, or Facebook

Have something to add?
Draft saved Draft deleted