1/13
Looks like no tags are added yet.
Name | Mastery | Learn | Test | Matching | Spaced | Call with Kai |
|---|
No analytics yet
Send a link to your students to track their progress
Combination
When order doesn’t matter
Combination equation
Same as binomial theorem - nCr = n!/r!(n-r)!
Permutation
Order matters
Permutation equation
nPr = n!/(n-r)!
Distinct Permutations Equation
n!/(n1!*n2!*…nk!)
Nothing can be repeated
n!
Nothing can be repeated
n!
or, if one task can be done in m ways and a second mutually exclusive task can be done in n ways
Add (m + n)
And, one event can occur in m ways and another can occur in n ways
Multiply (mn)
When making one choice doesn’t affect the rest (items can be reused)
n^k
Yes/No, True/False
2^n
Creating ordered list (with repetition allowed)
n^k (y^z)( a^b ) …
Total number of options
n
Selection Amount
r