91Ó°ÊÓ

Combinations are a fundamental part of combinatorics and they refer to the selection of objects or people where the arrangement doesn’t matter. Imagine you have a deck of cards and you want to pick three cards. If the specific order of picking those cards is not important, you’re dealing with combinations. This concept is used in various fields, including mathematics, statistics, and even in planning events.

To calculate combinations, you can use the combination formula:

• Notation: \( C(n, r) \)
• The formula: \( C(n, r) = \frac{n!}{r!(n-r)!} \)

Here, \( n \) is the total number of items to choose from, and \( r \) is the number of items to choose.
This equation shows that you're dividing out the permutations of the selected items so that different orders of the same items aren't counted multiple times. In the exercise's context, when you're picking a jury out of 40 people without caring about the order, you apply this formula to find how many unique groups can be made. It's fantastic because it allows you to efficiently calculate large sets without having to list every combination.

Factorials are a key mathematical operation, especially in combinatorics. The factorial of a non-negative integer \( n \) is the product of all positive integers less than or equal to \( n \). The notation is \( n! \). For example, \( 4! = 4 \times 3 \times 2 \times 1 = 24 \).

• Important Values: \( 0! = 1 \) by definition
• \( 1! = 1 \)

Factorials grow extremely fast. They are used to compute permutations and combinations because they simplify the repeated patterns found in arrangements and selections.
For instance, in calculating combinations such as \( C(40,12) \), you need the factorials of 40, 12, and 28 (since \( 28 = 40 - 12 \)). This operation helps in reducing the complexity of the calculations by avoiding manual computation of each arrangement possibility, hence making things simpler and manageable.

Permutations are another core component of combinatorics, and contrary to combinations, they focus on scenarios where order matters. If you’re arranging books on a shelf or planning a sequence of events, permutations will come into play.
The formula for permutations of \( n \) things taken \( r \) at a time is:

• Notation: \( P(n, r) \)
• Formula: \( P(n, r) = \frac{n!}{(n-r)!} \)

Here, \( n! \) accounts for all possible orders of the selected items, while \((n-r)!\) cancels out the arrangements beyond what's selected.
While the exercise focuses on combinations, understanding permutations helps to appreciate how specific ordering changes calculations. If, for example, the question asked not about selecting the jury, but ordering the jury in a line, permutations of 40 people selected 12 at a time could be used instead.
Thus, learning the difference between permutations and combinations is crucial for accurately solving problems where the order of selection is a factor!