One experiment results in n outcomes and and other in m there are mn possible outcomes in both the experiments together
r experiments that result in
Permutations are Ordered arrangements
If n objects are to be arranged (where placement matters) and there are n number of spaces, there are n! posible arrangements
n objects are to be arranged but
Order is irrelevant. The number of combinations of a set of data is$$C^n_r=\frac{n!}{(n-r)!r!}$$ Where:
- n→ number of objects
- r-> number of positions
Total combinations = combinations with a particular object + combinations without that object $$C^n_r=C^{n-1}{r-1}+C^{n-1}{r}$$