91Ó°ÊÓ

Combinatorics is the branch of mathematics that deals with counting, arranging, and grouping items. In the context of this exercise, we are interested in calculating the number of ways in which we can select 4 balls from a total of 8 balls in the urn, which includes both black and white balls.
When we talk about combinations, we use the binomial coefficient notation, represented as \( \binom{n}{k} \), which means choosing \( k \) items from \( n \) total items without considering the order. In this exercise, to choose 4 balls out of 8, we use \( \binom{8}{4} \) since the order of selection doesn't matter.

Specifically for this problem, we not only want to choose 4 balls but also need a certain configuration: 2 white and 2 black. The number of ways to choose 2 white balls out of 4 white ones is \( \binom{4}{2} \), and similarly, the number of ways to choose 2 black balls from 4 black ones is again \( \binom{4}{2} \). Hence, the total number of desirable selections can be calculated as the product of the two combinations: \( \binom{4}{2}\binom{4}{2} \).
The power of combinatorics lies in allowing us to systematically count various configurations even in complex scenarios.

Random selection involves picking items from a set without any specific pattern or predictability. In these problems, we are dealing with probability and chance. The choice of balls from an urn is a classic representation of random selection in probability theory.
Every time we select balls from the urn, each ball has an equal probability of being chosen. This randomness is key to calculating the probability of a certain event occurring, such as drawing exactly 2 white and 2 black balls. The unpredictability of the outcome means that each draw has to consider all possible combinations of selected balls.

To make sure that our selections reflect true randomness, we assume that each ball is equally likely to be picked. This means when a problem states that the draw is random, it confirms no bias or pre-conditions influence the selection process, highlighting the core idea of uniform probability distribution. Ensuring a random selection helps us apply our knowledge of probability accurately to predict outcomes.

Complementary probability is a useful concept that involves determining the probability that a certain event does not occur. This principle is often simpler, especially if calculating the direct probability is complex.
For any event \( A \), the probability of the event not happening is given by \( 1 - P(A) \). Here in the urn problem, the event \( A \) is drawing exactly 2 white and 2 black balls. If we know the probability of this happening, \( P(A) \), the complementary probability of not drawing 2 white and 2 black balls is \( 1 - P(A) \).

Understanding this concept allows us to efficiently determine the probability of continuous failure until success. In this exercise, to find the probability of exactly \( n \) selections, recognizing that it entails failing \( n-1 \) times and succeeding on the \( n \)th time, is key. Using complementary probability makes it easy to first calculate all possible successful outcomes and then use subtraction to find the failure rate, streamlining complex probability problems.