Scribd Logo
Upload

Welcome to Scribd!

  • Combinatorial Probability

    Uploaded by

    Smoochie Walance
    23 views2 pages
    This document discusses concepts related to probability theory, including: - The probability of an event E occurring in a sample space S is defined as P(E)=|E|/|S|. - Permutations refer to distinct ordered arrangements, while combinations refer to unordered selections. - The number of permutations of n distinct objects taken r at a time is n(n-1)...(n-r+1). The number of combinations is calculated using binomial coefficients. - Multinomial coefficients are used to calculate the number of ways of distributing n indistinguishable objects into r groups.

    Original Description:

    Combinatorial Probability

    Copyright

    © © All Rights Reserved

    Available Formats

    PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    Report this Document
    This document discusses concepts related to probability theory, including: - The probability of an event E occurring in a sample space S is defined as P(E)=|E|/|S|. - Permutations refer to distinct ordered arrangements, while combinations refer to unordered selections. - The number of permutations of n distinct objects taken r at a time is n(n-1)...(n-r+1). The number of combinations is calculated using binomial coefficients. - Multinomial coefficients are used to calculate the number of ways of distributing n indistinguishable objects into r groups.

    Copyright:

    © All Rights Reserved
    Download as PDF, TXT or read online from Scribd
    Flag for inappropriate content
    Download as pdf or txt
    23 views2 pages

    Combinatorial Probability

    Uploaded by

    Smoochie Walance
    This document discusses concepts related to probability theory, including: - The probability of an event E occurring in a sample space S is defined as P(E)=|E|/|S|. - Permutations refer to distinct ordered arrangements, while combinations refer to unordered selections. - The number of permutations of n distinct objects taken r at a time is n(n-1)...(n-r+1). The number of combinations is calculated using binomial coefficients. - Multinomial coefficients are used to calculate the number of ways of distributing n indistinguishable objects into r groups.

    Copyright:

    © All Rights Reserved
    Download as PDF, TXT or read online from Scribd
    Flag for inappropriate content
    Download as pdf or txt
    of 2

    aeconom@math.uoa.

    gr

    20 2010

    |E |
    =
    |S |

    ( )=

    P E

    |E |

    ,

    , .

    , 1

    n1

    , 2

    ), 3

    n2

    n3

    (,
    (,

    ) ...
    ,

    n-

    n1 n2

    r -

    nr

    nr

    ).
    n

    0!

    ! = n(n 1)(n 2) 1:

    1.

    k -

    ( ). To

    !
    = n(n 1)(n 2) (n k + 1):
    (n k )!
    n

    n.

    k -

    ( ). To
    k

    n :

    , (

    ).

    . To

     
    n

    !
    :
    k !(n k )!
    n

    :
    n

    (x + y ) =

     
    n
    X
    n
    k

    =0

    x y

     
    n

    k,

     
    
    1
    n 1
    +
    ; 1 k n;
    k 1
    k

    ( Pascal).

    ( ). To
    n

    
    +k1
    k

    
    =

    
    +k1
    (n + k 1)!
    :
    =
    k !(n 1)!
    n 1

    n1 ; n2 ; : : : ; nr

    = n1 + n2 + + nr

    !
    (n1 + n2 + + nr )!
    =
    n1 !n2 ! nr !
    n1 !n2 ! nr !
    n

    n k; nk .

    (n1 ;n2 ;:::;nr ): n1 +n2 ++nr =n

    O
    .

    n1 ; n2 ; : : : ; nr

    n1 n2

    n1

    !
    n1
    n2
    x
    x
    xnr r :
    ! nr ! 1 2

    (x1 + x2 + + xr )n =

    1,

    n2


    1 2
    ). ,
    1 2
    .

    2 ...,
    n

    nr

    n ; n ; : : : ; nr

    n ; n ; : : : ; nr

    (x1 ; x2 ; : : : ; xn )
    x1

    + x2 + : : : + xn = k:

    +k1

    0 1

    k,

    x1 ; x2 ; : : : ; xn

    You might also like