91Ó°ÊÓ

One of the fundamental concepts in combinatorics is the formula for calculating combinations. Combinations are used when the order of selection does not matter. Unlike permutations, where order is important, combinations focus solely on which items are selected.

The formula to calculate combinations is given by:

• \( _{n}C_{r} = \frac{n!}{r!(n-r)!} \)

Here,

• \( n \) is the total number of items to choose from.
• \( r \) is the number of items to be selected.
• The exclamation mark (!) denotes a factorial, which we'll explore next.

This formula helps to determine the total number of ways to choose \( r \) items from \( n \) items without considering the order of selection. For instance, when finding \(_{6}C_{2}\), we're interested in determining the number of ways to select 2 items from a pool of 6, using the concept of combinations.

Factorials are crucial in the calculations involving combinations and permutations.
A factorial, denoted with an exclamation mark, is the product of all positive integers up to a given number. For example, \(5!\) (read as "five factorial") is calculated as:

• \(5! = 5 \times 4 \times 3 \times 2 \times 1 = 120\)

Factorials grow rapidly with larger numbers, which is why they are very useful in combinatorics to account for all possible ways to arrange elements.

In the combinations formula \(_{n}C_{r} = \frac{n!}{r!(n-r)!} \), factorials help simplify the problem of counting sets. In our case with \( _{6}C_{2} \), calculating \(6!\) can simplify how we determine different ways to select pairs from six items. By canceling out common terms in the numerator and denominator, the calculation becomes more manageable.

Binomial coefficients arise from the binomial theorem, which provides a way to expand expressions of the form \((a + b)^n\). The coefficients of the expanded expression are given by the binomial coefficients, often noted as \( _{n}C_{r} \).

Interestingly, they have practical applications in counting principles like combinations. In our example with \(_6C_2\) and \(_6C_4\), the coefficients tell us how many ways we can choose groups of items from a larger set.

• Choosing 2 items from 6: \(_6C_2 = 15\)
• Choosing 4 items (which is the complement of choosing 2): \(_6C_4 = 15\)

They reveal an important identity: \( _{n}C_{r} = _{n}C_{n-r} \). This shows the symmetry in choosing \(r\) items versus not choosing \(r\) items out of \( n \), offering flexibility in calculations and deeper insight into the nature of combinations.