Processing math: 100%
Skip to main content
Library homepage
 

Text Color

Text Size

 

Margin Size

 

Font Type

Enable Dyslexic Font
Statistics LibreTexts

Search

  • Filter Results
  • Location
  • Classification
    • Article type
    • Author
    • Cover Page
    • License
    • Show TOC
    • Embed Jupyter
    • Transcluded
    • OER program or Publisher
    • Autonumber Section Headings
    • License Version
  • Include attachments
Searching in
About 1 results
  • https://stats.libretexts.org/Bookshelves/Probability_Theory/Introductory_Probability_(Grinstead_and_Snell)/03%3A_Combinatorics/3.02%3A_Combinations
    In the same way, to have a particular pair (ai,aj) fixed, we can choose any permutation of the remaining n2 elements; there are (n2)! such choices and thus \[P(A_i \cap A_j) = \fra...In the same way, to have a particular pair (ai,aj) fixed, we can choose any permutation of the remaining n2 elements; there are (n2)! such choices and thus P(AiAj)=(n2)!n!=1n(n1) . The number of terms of this form in the right side of Equation [eq 3.5] is (n2)=n(n1)2! . Hence, the second term of Equation [eq 3.5] is n(n1)2!1n(n1)=12! . Similarly, for any specifi…

Support Center

How can we help?