Use LEFT and RIGHT arrow keys to navigate between flashcards;
Use UP and DOWN arrow keys to flip the card;
H to show hint;
A reads text to speech;
5 Cards in this Set
- Front
- Back
Product rule |
a sequence can be broken down into two tasks. If n1 ways of doing task 1 and n2 ways of doing task 2, then n1*n2 ways of doing procedure |
|
sum rule |
if task can be performed n1 or n2 ways, then there are n1+n2 ways to do the task |
|
Generalized pigeonhole principle |
If n objects are placed into k boxes, then there is at least one box containing [N/k] objects |
|
Permutation |
n!/(n-r)! |
|
combination |
n!/(n-r)!(r)! |