91Ó°ÊÓ

Understanding how to calculate different scenarios in probability often starts with the counting principles. These are fundamental concepts that establish the groundwork for determining the number of ways certain events can occur.

Two main counting principles are pertinent to many probability exercises: the multiplication rule and the addition rule. The multiplication rule states that if you want to find the number of outcomes for a sequence of events, you multiply the number of ways each event can occur. However, in our movie ticket example, the order of selection doesn't matter, so we don't use the multiplication rule directly.

The addition rule is applied when you calculate the number of outcomes when there are several different possible events, but again, for the movie ticket problem, it's about combinations of people rather than independent events that add up.

In summary, while these counting principles are the backbone of understanding more complex probability problems, for questions about combinations of a group, as in the movie ticket example, we delve further into combinations and factorials to calculate our probabilities accurately.

Combinations are a key concept when dealing with problems where the order of selection isn't important. In our textbook scenario, we're looking at how to select 2 friends from a group of 10 without caring about the order they're chosen in - this is a classic use of combinations.

To understand combinations, one should grasp the idea of 'n choose r' — written as \( C(n, r) \). This represents the different ways you can choose \( r \) items from \( n \) without regard to the order. The formula for this, \( C(n, r) = \frac{n!}{r!(n-r)!} \), incorporates factorials (which we'll discuss in the next section). Here's a practical use of combinations in our problem:

• The total number of ways to pick 2 friends from 10 is \( C(10, 2) = 45 \).
• To find the probability of selecting 2 boys from a group of 5, we calculate \( C(5, 2) = 10 \).

These calculations allow us to solve our exercise’s question by providing a structured way to count without listing every possible group or pair, which becomes unfeasible with larger numbers.

The factorial is a mathematical operation that is pivotal to computing combinations and, by extension, to solving many probability problems. Represented by an exclamation mark \( ! \), a factorial is the product of all positive integers less than or equal to a certain number. For instance, the factorial of 5 or \( 5! \) is calculated as \( 5 \times 4 \times 3 \times 2 \times 1 = 120 \).

Factorials grow extremely fast, making manual calculations cumbersome for large numbers. That's why for larger numbers, it's always better to use a calculator or software.

Factorials are not only used when calculating the number of permutations (where the order is important) but also for combinations. The formula for combinations, as seen in the textbook exercise, includes factorials in both the numerator and denominator which helps reduce the expression to a more manageable number, as we did when calculating the number of ways to pick 2 boys from a group of 5. This simplification is crucial for smoothly finding the solution without getting lost in the multiplication of large numbers.