GRE Probability and Counting Methods

Mastering probability and counting methods is essential for maximizing your score on the GRE Quantitative Reasoning section. These concepts are woven throughout data analysis questions and problem-solving tasks, often disguised in word problems that test your logical structuring as much as your calculation skills. A firm grasp of when to apply specific rules and formulas will help you solve these problems efficiently and avoid the common traps set by test makers.

Probability Essentials: The Foundation

Probability quantifies the likelihood of an event occurring, expressed as a number between 0 and 1. The most basic formula is: $P(\text{Event})=\frac{\text{Number of favorable outcomes}}{\text{Total number of possible outcomes}}$. For example, the probability of rolling a 5 on a fair six-sided die is $\frac{1}{6}$. A foundational rule is the complementary probability: the probability an event does not occur is $1-P(\text{Event})$. This is frequently the fastest path to an answer. If the probability of rain tomorrow is 0.3, the probability it does not rain is $1-0.3=0.7$.

Two critical operations govern how probabilities combine: "AND" and "OR." The keyword AND signals multiplication of probabilities. The keyword OR signals addition of probabilities. However, applying these rules correctly depends entirely on whether the events are independent or mutually exclusive. A complementary probability approach often simplifies "at least one" problems. Instead of calculating multiple scenarios, calculate the probability of none and subtract from 1.

Core Probability Rules: Independent, Dependent, and Conditional

Understanding event relationships is crucial. Independent events are those where the outcome of one does not affect the other, like flipping a coin twice. For independent events A and B, $P(\text{A AND B})=P(A)\times P(B)$. If the probability of passing Part I of a test is 0.8 and Part II is 0.7 (independent), the probability of passing both is $0.8\times 0.7=0.56$.

Dependent events are linked; the outcome of the first affects the probability of the second. Drawing cards without replacement is a classic example. Here, $P(\text{A AND B})=P(A)\times P(B|A)$, where $P(B|A)$ is the conditional probability of B given A has occurred. If a bag has 3 red and 2 blue marbles, the probability of drawing two red marbles without replacement is $(\frac{3}{5})\times (\frac{2}{4})=\frac{3}{10}$.

Conditional probability $P(B|A)$ itself is the probability of event B occurring given that event A has already occurred. Its formula is $P(B|A)=\frac{P(\text{A AND B})}{P(A)}$. On the GRE, you might be given a two-way table (e.g., survey data) and asked for the probability a person is in Group X given they are in Group Y. You would then consider only the Group Y total as your denominator.

Counting Methods: Permutations and Combinations

Before calculating probabilities, you often need to count possible outcomes. The fundamental counting principle states that if one event can occur in $m$ ways and a second independent event can occur in $n$ ways, then the two events can occur in $m\times n$ ways. If you have 4 shirts and 3 pairs of pants, you have $4\times 3=12$ possible outfits.

When the order or arrangement matters, you use permutations. The number of ways to arrange $r$ items from a set of $n$ distinct items is: $${}_n{P}_r=\frac{n!}{(n-r)!}$$ For example, the ways to award gold, silver, and bronze medals (order matters) to 10 contestants is ${}_{10}{P}_3=10\times 9\times 8=720$.

When the order does not matter, you use combinations. The number of ways to choose a group of $r$ items from a set of $n$ distinct items is: $${}_n{C}_r=\left(\genfrac{}{}{0ex}{}{n}{r}\right)=\frac{n!}{r!(n-r)!}$$ For example, the number of ways to choose a committee of 3 people from 10 candidates is $\left(\genfrac{}{}{0ex}{}{10}{3}\right)=\frac{10\times 9\times 8}{3\times 2\times 1}=120$. The division by $r!$ removes the counted arrangements of the selected group. Always ask yourself: "Is Team A getting Bob then Sue different from Sue then Bob?" If no, use combinations.

Strategic Integration and GRE Application

The GRE integrates these concepts. A single problem may require you to count total outcomes (using combinations), count favorable outcomes (using another combination or permutation), and then calculate a probability. A common structure is: "From a group of X, a committee of Y is selected. What is the probability that it contains Z specific people?" Here, the total outcomes are $\left(\genfrac{}{}{0ex}{}{X}{Y}\right)$. The favorable outcomes assume the Z people are already on the committee, so you need to choose the remaining $(Y-Z)$ people from the remaining $(X-Z)$ people: $\left(\genfrac{}{}{0ex}{}{X-Z}{Y-Z}\right)$. The probability is the ratio of these combinations.

Another key strategy is recognizing problems where simplifying with the complement is faster. Questions asking for the probability of "at least one" success in multiple trials are solved by $1-P(\text{zero successes})$. For "at least one heads" in three coin flips, calculate $1-P(\text{all tails})=1-(\frac{1}{2}{)}^3=\frac{7}{8}$. This avoids calculating the probability for 1, 2, and 3 heads separately.

Common Pitfalls

1. Adding Instead of Multiplying (and vice versa): The most frequent error is misusing the "AND" and "OR" rules. Remember, "AND" means multiply probabilities for independent/dependent events. "OR" means add probabilities only if the events are mutually exclusive (they cannot both happen). If events are not mutually exclusive, you must subtract the overlap: $P(A\text{ OR }B)=P(A)+P(B)-P(A\text{ AND }B)$.

• Correction: Identify the connecting word. For "A and B both happen," look for independence/dependence. For "A or B happens," check for mutual exclusivity.

1. Confusing Permutations and Combinations: Using the wrong formula wastes time and yields an incorrect answer. A committee, a hand of cards, or a simple selection implies order does not matter—use combinations. Arranging people in a line, assigning distinct roles, or creating passwords implies order matters—use permutations.

• Correction: Before calculating, perform the "order test." Swap two elements in your imagined outcome. If it creates a new, valid outcome, order matters (permutations). If it's the same group, order doesn't matter (combinations).

1. Forgetting to Adjust for Dependence: When sampling without replacement, the total number of outcomes and the composition of favorable outcomes change for subsequent draws. Treating them as independent is a trap.

• Correction: Look for phrases like "without replacement," "simultaneously chosen," or "kept out." Adjust probabilities sequentially or use combinations to model the simultaneous selection.

Summary

• Probability Fundamentals: $P(E)=\frac{\text{favorable}}{\text{total}}$. The complement rule, $P(\text{not }E)=1-P(E)$, is a powerful shortcut for "at least one" problems.
• Combining Probabilities: "AND" implies multiplication. "OR" implies addition, but you must subtract the overlap $P(A\text{ AND }B)$ if events are not mutually exclusive.
• Event Relationships: For independent events, $P(A\text{ AND }B)=P(A)P(B)$. For dependent events, $P(A\text{ AND }B)=P(A)P(B|A)$. Conditional probability is $P(B|A)=\frac{P(A\text{ AND }B)}{P(A)}$.
• Counting Principles: The fundamental counting principle multiplies possibilities for sequential choices. Use permutations (${}_n{P}_r$) when order matters. Use combinations (${}_n{C}_r$ or $\left(\genfrac{}{}{0ex}{}{n}{r}\right)$) when order does not matter.
• GRE Strategy: Deconstruct word problems into a counting phase (to find total and favorable outcomes) and a probability phase. Always perform the "order test" to choose between permutations and combinations.