\( n \ge r \ge 0 \) both integers
A combination is a selection of items from a set without regard to the order. The number of combinations of \( n \) distinct objects taken \( r \) at a time is denoted by \( C(n,r) \), \( \binom{n}{r} \) or \( {}_nC_r \).
example: choosing 3 items from a set of 8 gives \[ C(8,3) = \frac{8!}{5! \cdot 3!} = \frac{8\cdot7\cdot6}{3\cdot2\cdot1} = 56 \] possible groups.
Use combinations when you want to count subgroups where order is irrelevant (e.g., lottery numbers, card hands, selecting a committee). For ordered arrangements, use permutations calculator.