Home

Tutoring

Subjects

Live Classes

Study Coach

Essay Review

On-Demand Courses

Colleges

Games

Opening subject page...

Loading your content

  1. SSAT Upper Level Quantitative

  3. Solve probability problems involving outcomes.

SSAT UPPER LEVEL • QUANTITATIVE

Solve probability problems involving outcomes.

Learn to count outcomes efficiently and calculate probabilities accurately for real-world decisions.

SECTION 1

Historical Context and Motivation

Probability theory began in the 17th century when mathematicians tackled real gambling problems. Blaise Pascal and Pierre de Fermat exchanged letters in 1654 to solve a dice game division issue. Their work laid the foundation for counting outcomes systematically. This addressed the need for fair decisions in uncertain events like games or lotteries. Today, these ideas help predict risks in sports, weather, and business choices.

1654
Pascal-Fermat Letters
Pascal and Fermat develop expected value through dice problems, birthing probability.
1665
Huygens' Book
Christiaan Huygens publishes the first probability book on games of chance.
1713
Bernoulli's Law
Jacob Bernoulli proves the law of large numbers, linking outcomes to long-run frequencies.
1812
Laplace's Treatise
Pierre-Simon Laplace expands probability to astronomy and insurance.

These milestones show how counting outcomes solved practical problems. Early gamblers needed ways to divide pots fairly based on winning chances. Understanding total possible results versus favorable ones became essential. You can now apply this to SSAT questions confidently.

SECTION 2

Core Principles of Probability

Probability measures the likelihood of an event using the ratio of favorable outcomes to total outcomes. The sample space lists all possible outcomes equally likely. Events are subsets of this space. Key principles include the fundamental counting principle, which multiplies choices for independent events.

1

Sample Space (S)

Set of all possible outcomes. For a coin flip, S = {H, T}.
2

Favorable Outcomes

Results matching the event. Subset of S.
3

Probability Formula

P(E) = (number of favorable) / |S|.
4

Counting Principle

If n ways for A and m for B, total = n × m.
✦ KEY TAKEAWAY
Think of probability like picking a favorite song from your playlist. The total songs are your sample space, favorites are favorable outcomes, and probability is that fraction. This makes random events predictable and fair.
SECTION 3

Visualizing Sample Spaces

Sample Space for Rolling Two Fair Dice All 36 equally likely outcomes — favorable outcomes for sum = 7 highlighted in cyan Die 2 Die 1 ⚀ 1 ⚁ 2 ⚂ 3 ⚃ 4 ⚄ 5 ⚅ 6 ⚀ 1 ⚁ 2 ⚂ 3 ⚃ 4 ⚄ 5 ⚅ 6 (1,1) (1,2) (1,3) (1,4) (1,5) (1,6) (2,1) (2,2) (2,3) (2,4) (2,5) (2,6) (3,1) (3,2) (3,3) (3,4) (3,5) (3,6) (4,1) (4,2) (4,3) (4,4) (4,5) (4,6) (5,1) (5,2) (5,3) (5,4) (5,5) (5,6) (6,1) (6,2) (6,3) (6,4) (6,5) (6,6) = Favorable outcomes (sum = 7) Total outcomes in sample space: 6 × 6 = 36 Favorable outcomes (sum = 7): 6 — (1,6) (2,5) (3,4) (4,3) (5,2) (6,1) P(sum = 7) = 6 36 = 1 6 ≈ 16.67% ( the most probable sum for two dice )
This grid shows 36 equally likely outcomes for two dice. Highlighted cells represent sums of 7. Notice how visual counting reveals probabilities quickly.

The diagram illustrates a complete sample space with 6 × 6 = 36 outcomes. Favorable ones for sum 7 are shaded cyan. This visual method confirms P = 6/36 = 1/6. Use grids like this for small sample spaces on the SSAT. It builds intuition before calculations.

SECTION 4

Mathematical Framework

Start with the basic probability formula for equally likely outcomes. Identify the sample space size using counting rules. Then count favorable cases. SSAT problems often require multi-step counting without calculators.

BASIC PROBABILITY
P(E) = rac{|E|}{|S|}
|E| = favorable outcomes, |S| = total outcomes in sample space.
FUNDAMENTAL COUNTING PRINCIPLE
|S| = n_1 × n_2 × ⋯ × n_k
n_i = choices at each independent stage.

These formulas connect counting to probability. For example, three coins have 2³ = 8 outcomes. Practice simplifying fractions like 3/8 mentally. This prepares you for complex SSAT scenarios efficiently.

SECTION 5

Detailed Breakdown of Counting Methods

Tree Diagram: Drawing 2 Marbles Without Replacement Bag contains 3 Red and 2 Blue marbles (5 total) Start 3/5 2/5 R B 2R, 2B left 3R, 1B left 2/4 2/4 3/4 1/4 RR RB BR BB 3/5 × 2/4 = 6/20 3/5 × 2/4 = 6/20 2/5 × 3/4 = 6/20 2/5 × 1/4 = 2/20 ★ Both Red Verify: All outcomes sum to 1 6/20 + 6/20 + 6/20 + 2/20 = 20/20 ✓ P(Both Red) = 6/20 = 3/10 = 0.30 Draw 1 Draw 2 Outcome
Tree diagram for drawing 2 marbles from 3 red and 2 blue without replacement. Branches show conditional probabilities. Leaf nodes count all outcome paths.

Tree diagrams excel for sequential events with or without replacement. Each branch multiplies probabilities along paths. Total outcomes equal leaf nodes. This method visualizes dependencies clearly. SSAT often tests both replacement cases.

  • With replacement: outcomes stay independent, |S| = n^k.
  • Without replacement: |S| = n × (n-1) × ⋯, trees help count.
SECTION 6

Step-by-Step Worked Example

A bag has 4 red and 3 green marbles. You draw two without replacement. What is the probability both are red? This requires careful counting.

Probability Both Red

Step 1: Total outcomes

First draw: 7 choices, second: 6 choices. |S| = 7 × 6 = 42.
42

Step 2: Favorable outcomes

First red: 4/7, then second red: 3/6. Paths: 4 × 3 = 12.
12

Step 3: Calculate P

P = 12 / 42 = 2 / 7.
2/7
💡 Tip
Always order matters in sequences without replacement. Verify by listing if small numbers.
SECTION 7

Strengths, Limitations, and Pitfalls

Counting outcomes shines in structured problems but falters with large numbers or dependencies. Watch for overcounting permutations as combinations. SSAT distractors exploit these errors.

Compare methods for SSAT efficiency.
MethodStrengthsPitfalls
GridsVisual, exhaustive for small sets.Impractical for >20 outcomes.
TreesHandles sequences clearly.Branches explode for many steps.
FormulasScales to large problems.Forgets replacement rules.
✦ KEY TAKEAWAY
Avoid pitfalls by sketching small cases first, then scaling with formulas. Like checking a map before driving, verify counts build confidence.
SECTION 8

Connections to Advanced Probability

Basic outcome counting leads to conditional probability and combinations. SSAT upper level hints at these, preparing for SAT or ACT. Understand when to use permutations versus combinations.

BasicAdvanced
P(E) = favorable / totalP(A|B) = favorable for A and B / total for B
n × m for sequencesC(n,k) = n! / (k!(n-k)!) for selections

Mastering basics unlocks these extensions. Practice spotting selection without order. You will ace advanced problems with this foundation.

SECTION 9

Practice Problems

PROBLEM 1 — CONCEPTUAL
In a sample space with 10 equally likely outcomes, an event has 2 favorable. What is P(E)? A) 1/10 B) 1/5 C) 2/10 D) 1/2 E) 10/2
PROBLEM 2 — BASIC CALCULATION
A coin is flipped and a die rolled. Probability of heads and 4? A) 1/12 B) 1/6 C) 1/2 D) 1/3 E) 4/12
PROBLEM 3 — INTERMEDIATE
3 shirts, 2 pants. Outfits? A) 3 B) 5 C) 6 D) 12 E) 3×2=6 wait no
PROBLEM 4 — APPLIED
Committee: 4 people choose 2 president/vice from 5 eligible. Ways? A) 10 B) 20 C) 25 D) 5×4=20 E) C(5,2)=10
PROBLEM 5 — CRITICAL THINKING
Deck 52 cards, draw 2 without replacement, both aces? A) 4/52 × 4/52 B) (4/52)×(3/51) C) C(4,2)/C(52,2) D) 6/1326 E) 1/221
SUMMARY

Lesson Summary

Master sample spaces, counting principles, and P(E) = favorable / total. Use grids and trees for visualization.

Practice distinguishes replacement cases and orders. You now solve SSAT probability confidently. Review pitfalls to avoid distractors.

Varsity Tutors • SSAT Upper Level • Solve probability problems involving outcomes.