#reading-9-probability-concepts
The number of ways to assign every member of a group of size n to n slots is n! = n (n − 1) (n − 2)(n − 3) … 1. (By convention, 0! = 1.)
If you want to change selection, open document below and click on "Move attachment"
Summary rst step in a process can be done in 10 ways, the second step, given the first, can be done in 5 ways, and the third step, given the first two, can be done in 7 ways, then the steps can be carried out in (10)(5)(7) = 350 ways.
<span>The number of ways to assign every member of a group of size n to n slots is n! = n (n − 1) (n − 2)(n − 3) … 1. (By convention, 0! = 1.)
The number of ways that n objects can be labeled with k different labels, with n 1 of the first type, n 2 of the second type, and so on, with n 1 + n 2 + … + n k = Summary
| status | not read | | reprioritisations | |
|---|
| last reprioritisation on | | | suggested re-reading day | |
|---|
| started reading on | | | finished reading on | |
|---|
Details