Probability

The formal study of probability did not emerge from abstract curiosity alone; it was born from very practical questions about games of chance, insurance, and the reliability of evidence. For centuries, humans had intuitive notions of likelihood — ancient dice carved from animal bones attest to our long fascination with randomness — but a rigorous mathematical framework only crystallized in the seventeenth century when two French mathematicians began exchanging letters about a seemingly simple gambling puzzle.

The famous Problem of Points asked how to divide stakes fairly when a game of chance is interrupted before completion. The resulting correspondence between Blaise Pascal and Pierre de Fermat in 1654 is widely regarded as the founding moment of probability theory. Their work demonstrated that uncertain outcomes could be analyzed with the same precision as geometry or algebra, opening the door to centuries of refinement that would eventually produce the axiomatic system used on the GRE today.

Understanding this lineage matters because the GRE tests probability precisely as Laplace and Kolmogorov framed it: as a numerical measure between 0 and 1 that obeys specific axioms and rules. The central question the theory answers is deceptively simple — given a well-defined set of outcomes, how likely is a particular event? Every probability problem on the exam is, at its core, an application of this question.

Before tackling any GRE probability problem, you need a firm grasp of the vocabulary and foundational rules that govern how probabilities behave. These principles are not merely theoretical niceties; they are the precise tools the test expects you to wield when parsing word problems under time pressure. The four concepts below form the backbone of every probability question you will encounter.

A well-constructed diagram can turn an abstract probability question into a concrete counting exercise. The Venn diagram is the single most useful visual tool for GRE probability because it partitions the sample space into non-overlapping regions whose probabilities must sum to 1. The diagram below illustrates two events A and B within a universal sample space, showing the four mutually exclusive regions that arise whenever two events overlap.

Notice that the diagram naturally encodes the Addition Rule at the bottom: when you add P(A) and P(B), you double-count the intersection, so you must subtract P(A ∩ B) once. This visual logic is exactly how the GRE constructs many of its probability questions — they give you partial information about the regions and expect you to fill in the rest using the constraint that all regions sum to 1. Whenever a problem mentions two events, your first instinct should be to sketch this diagram and populate its regions with the given values.

The GRE tests four primary probability formulas. Mastering when to deploy each formula — and recognizing the verbal cues that signal which one is needed — is the core skill that separates high scorers from the rest. Below, each formula is presented with its variable definitions and the exam context in which it most commonly appears.

Many GRE probability problems involve sequential experiments — drawing cards one after another, flipping coins multiple times, or selecting items without replacement. A probability tree (also called a tree diagram) is the ideal tool for these multi-stage scenarios. Each branch represents one possible outcome at a given stage, and the probability of a complete path through the tree is the product of the probabilities along its branches. The sum of all terminal branch probabilities equals 1, providing a built-in error check.

The tree above highlights a critical GRE concept: without replacement changes the conditional probabilities at each stage. After drawing a red ball first, only 4 balls remain (2 red, 2 blue), so the second-stage probabilities shift. Contrast this with with replacement, where the probabilities remain constant at every stage because the drawn item is returned. When the GRE specifies 'with replacement,' you can treat successive draws as independent events and simply multiply the original probabilities.

Notice that the probability of getting one ball of each color is P(RB) + P(BR) = 6/20 + 6/20 = 12/20 = 3/5. This illustrates a common pattern: when the question asks for the probability of a composition (e.g., 'one red and one blue') regardless of order, you must sum all paths that produce that composition. Forgetting to account for order is one of the most frequent mistakes on the GRE.

Let us work through a problem at a level of difficulty you are likely to see on the GRE Quantitative section. Pay special attention to the strategic decision of which formula to apply and when the complement rule offers a shortcut.

Probability problems on the GRE are designed to exploit common misconceptions. Recognizing these traps before test day can mean the difference between a careless error and a correct answer under pressure. The table below catalogues the most frequent pitfalls alongside the corrective strategy you should adopt.

The probability concepts tested on the GRE represent the entry point to a vast mathematical landscape. While the exam rarely ventures beyond the fundamentals, understanding how these basics connect to more advanced topics can deepen your intuition and help you handle unusual problem variations. The table below maps each GRE-level concept to its more sophisticated counterpart, which you may encounter in graduate coursework.

For the GRE specifically, the most important bridge concept is Bayes' Theorem, which occasionally appears in more challenging Quantitative Comparison or Data Interpretation questions. Bayes' Theorem is essentially the multiplication rule rearranged: P(A | B) = P(B | A) × P(A) / P(B). If you have mastered the multiplication rule and conditional probability, you already possess the conceptual machinery for Bayesian reasoning — the theorem simply provides the algebraic framework for inverting the conditioning direction.

Test your understanding with the five problems below, arranged in order of increasing difficulty. For each problem, attempt a full solution before reading the answer. Pay attention to the keywords ('and,' 'or,' 'at least,' 'without replacement') and let them guide your choice of formula.