|
⇤ ← Revision 1 as of 2024-02-07 16:39:57
Size: 340
Comment: Initial commit
|
← Revision 2 as of 2024-02-07 16:42:33 ⇥
Size: 533
Comment: Adding simple example
|
| Deletions are marked like this. | Additions are marked like this. |
| Line 17: | Line 17: |
| Intuitively, there are 3 ways to take 2 from a set of 3. (''A'' and ''B''; ''B'' and ''C''; ''A'' and ''C''.) Plugging ''n=3'' and ''k=2'' into the equation also yields the expected result. |
Combinations
A combination is an unordered subset.
Contents
Counting
The number of possible combinations depends on the size of the starting set and the number taken from it. These are notated as n and k respectively.
Intuitively, there are 3 ways to take 2 from a set of 3. (A and B; B and C; A and C.) Plugging n=3 and k=2 into the equation also yields the expected result.