91Ó°ÊÓ

Choosing a subset of items from a larger set without concern for the order in which they're selected is known as a combination. This is where the Combination Formula comes into play.

• The formula is written as \( C(n, r) = \frac{n!}{r!(n-r)!} \), where \( n \) represents the total number of items to choose from, and \( r \) stands for the number of items to select.
• Using the combination formula is perfect for scenarios like choosing members of a jury, a team, or selecting toppings for a pizza where order does not matter.

By dividing the calculations into organized steps, like identifying known variables and substituting them into the formula, we obtain the desired number of combinations. In the given problem, replacing the variables, we get \( C(40, 12) = \frac{40!}{12! \times 28!} \).
This yields the total number of possible ways to select 12 people from 40. The beauty of the combination formula is that it focuses solely on selection, disregarding the sequence in which items are picked.

Factorial is a fundamental concept in combinatorics, which involves multiplying a series of descending natural numbers. It is expressed as \( n! \) (read as 'n factorial'). The definition states:

• For any positive integer \( n \), \( n! = n \times (n−1) \times (n−2) \times \, ... \, \times 1 \).
• The factorial of 0 is defined as 1, which helps in certain calculations and ensures consistency within equations.

Factorials grow rapidly with increasing values of \( n \).
For example, calculating 12! would involve multiplying \( 12 \times 11 \times 10 \times ... \times 1 \).
In the context of our combination problem, we used factorials to compute the number of different ways to choose people from a group by applying them within the formula \( \frac{40!}{12! \times 28!} \). Factorials can be understood more easily when breaking them down into their components, ensuring calculations are done step-by-step.

Permutation is another essential concept in combinatorics, used when the order of selection matters. Unlike combinations, where order doesn't compare to permutations,

• Permutation counts different ways to arrange a subset of items within a larger set.
• The permutation formula is \( P(n, r) = \frac{n!}{(n-r)!} \), where order plays a crucial role in determining different arrangements.

Permutations typically apply to tasks like arranging books on a shelf or assigning roles in a play.
In contrast to the jury selection problem, if the order of chosen people mattered, permutations would be the tool to use. However, for non-ordered selections like the jury example, combinations take precedence. Understanding when to use permutations versus combinations relies partially on whether the order is significant in the given scenario.