The combination formula is a tool we use to calculate how many ways we can choose items without regard to order from a larger set. It is denoted as \( C(n, r) \) or \( \binom{n}{r} \), where \( n \) is the total number of items, and \( r \) is the number of items to choose.
The formula is: \[ C(n, r) = \frac{n!}{r!(n-r)!} \] This formula calculates how many different groups of `r` items can be formed from a set of `n` items.
Key points:
- Unlike permutations, combinations do not consider the order of items. Only the selection matters.
- The combination formula utilizes factorials to divide the total arrangements by the duplications that arise from internal ordering of selected items.
- This formula is fundamental in areas like binomial probability, lottery calculations, and any scenario involving selection without order.
In our exercise, we apply the combination formula to encapsulate both the concept of choosing items and the likelihood that sequence and order play no role in the outcome, showing its practical importance.