+++ title = "Permutations, combinations & probability" description = "Count outcomes with permutations and combinations, then compute probabilities in finite sample spaces." template = "chapter.html" weight = 33 [extra] subject = "math" chapter_id = "permutations-combinations-probability" strand = "Data Handling" +++
Counting methods make probability efficient when listing all outcomes is impractical.
\[ n!=n(n-1)(n-2)\cdots 1,\quad 0!=1. \]
\[ {}_nP_r=\frac{n!}{(n-r)!}. \]
Use for arrangements where position/order is important.
\[ {}_nC_r=\frac{n!}{r!(n-r)!}. \]
Use for selections/groups.
\[ P(E)=\frac{\text{count of favorable outcomes}}{\text{count of all outcomes}}. \]
Answer: \(7\times6\times5=210\).
Answer: \(\frac{8\cdot7}{2}=28\).
Answer: \({}_4P_3=24\).
Answer: \({}_{10}C_3=120\).
Answer: \(\frac{{}_{13}C_5}{{}_{52}C_5}\).