Multiplication Rule of Counting.
#reading-9-probability-concepts
If one task can be done in n1 ways, and a second task, given the first, can be done in n2ways, and a third task, given the first two tasks, can be done in n3 ways, and so on for k tasks, then the number of ways the ktasks can be done is (n1)(n2)(n3) … (nk).
If you want to change selection, open original toplevel document below and click on "Move attachment"
Summary
| status | not read | | reprioritisations | |
|---|
| last reprioritisation on | | | suggested re-reading day | |
|---|
| started reading on | | | finished reading on | |
|---|
Details