ACCUPLACER Quantitative Reasoning, Algebra & Statistics • Probability Sets

Basic Counting for Probability — Use basic counting ideas for simple probability (intro)

Learn how systematic counting of outcomes forms the foundation for calculating probabilities in everyday and test-prep scenarios.

Quantitative reasoning illustration with a scatter plot, summation sign, and calculator
Inside this lesson 10 sections 5 questions 8 figures

SECTION 1

Historical Context & Motivation

The idea that probability can be computed by counting favorable outcomes and dividing by the total number of possible outcomes is deceptively simple, yet it took centuries of mathematical development before this approach was formalized. Ancient civilizations played games of chance with dice, knucklebones, and drawing lots, but they lacked a rigorous framework for predicting outcomes. The breakthrough came when mathematicians realized that every probability question begins with the same task: enumerate what can happen, then isolate what you want to happen. This counting-first philosophy is the bedrock on which all modern probability theory rests, and it is precisely what the ACCUPLACER exam tests when it presents straightforward probability scenarios.

1564 • Cardano's Liber de Ludo Aleae

Gerolamo Cardano wrote the first systematic treatment of games of chance, articulating the idea that probability equals the ratio of favorable outcomes to total outcomes—though the work was not published until 1663.

1654 • Pascal–Fermat Correspondence

Blaise Pascal and Pierre de Fermat exchanged letters on the problem of points, developing combinatorial counting techniques that became the formal language of probability.

1713 • Bernoulli's Ars Conjectandi

Jacob Bernoulli published a foundational text linking counting principles to the law of large numbers, showing that observed frequencies converge to theoretical probability as trials increase.

1933 • Kolmogorov's Axioms

Andrey Kolmogorov placed probability on a rigorous measure-theoretic foundation. For finite sample spaces with equally likely outcomes, his framework reduces to the classical counting ratio P(A) = |A| / |S|.

The central question this lesson addresses is elegantly simple: How do we count the right things to calculate a probability? On the ACCUPLACER, you will encounter problems involving dice, cards, spinners, marbles in bags, and similar scenarios. Mastering the counting step—identifying the sample space and the event of interest—is the single most important skill for answering these questions quickly and accurately.

SECTION 2

Core Principles & Definitions

Before computing any probability, you need a precise vocabulary. The concepts below form the backbone of every counting-based probability calculation you will encounter. Each term corresponds to a concrete step in the problem-solving process, so understanding them is not merely academic—it is the key to translating word problems into arithmetic.

1

Experiment

Any process whose result is not certain beforehand. Rolling a die, drawing a card, or flipping a coin are all experiments. Identifying the experiment tells you what action generates the outcomes.
2

Sample Space (S)

The complete set of all possible outcomes of an experiment. For a standard die, S = {1, 2, 3, 4, 5, 6} and |S| = 6. Getting the sample space right is the most critical step.
3

Event (A)

A subset of the sample space representing the outcomes you care about. If you want an even number on a die, A = {2, 4, 6} and |A| = 3.
4

Equally Likely Outcomes

When every outcome in S has the same chance of occurring, we say outcomes are equally likely. This condition must hold for the classical probability formula to apply directly.
5

Classical Probability

The ratio P(A) = |A| / |S|. This fraction always falls between 0 and 1, where 0 means impossible and 1 means certain.
✦

KEY TAKEAWAY

Think of probability like a pizza. The sample space is the entire pie—every slice. The event is the slices you actually want. Probability is the fraction of the pie you get. If 3 out of 8 slices have pepperoni and you grab one at random, the probability of pepperoni is 3/8. The counting part is just figuring out how many slices are pepperoni and how many slices exist in total.

SECTION 3

Visual Explanation — Sample Space Anatomy

The diagram below illustrates the fundamental structure of a counting-based probability problem. A bag contains 10 marbles of different colors, and we want the probability of drawing a blue marble at random. The sample space is the entire collection of marbles, while the event is the subset of blue marbles. Notice how the probability formula emerges directly from the count of favorable outcomes over total outcomes.

Sample Space vs. Event: Marbles in a BagSample Space S — All 10 marbles (|S| = 10)Event A: Blue Marbles (|A| = 4)B1B2B3B4R1R2R3Y1Y2G1P(Blue) = |A| / |S| = 4 / 10 = 2/5Count the favorable (blue) outcomes, divide by total outcomesOther marbles (not in event A)
The dashed cyan rectangle encloses the event A (blue marbles). Everything inside the larger rounded rectangle is the sample space S. The probability is the ratio of cyan circles to all circles: 4/10 = 2/5.

This visual pattern—total rectangle for S, highlighted region for A—applies universally. Whether you are dealing with cards in a deck, students in a class, or outcomes of spinning a spinner, the logic never changes: identify the whole, identify the part, and form the ratio.

SECTION 4

Mathematical Framework

The mathematics of basic counting for probability rests on two complementary formulas. The first gives the probability of an event occurring; the second gives the probability of it not occurring. Together, they cover every simple probability question the ACCUPLACER can ask.

CLASSICAL PROBABILITY

P(A)=∣A∣/∣S∣P(A) = |A| / |S|

P(A) = probability of event A occurring; |A| = number of outcomes favorable to A; |S| = total number of equally likely outcomes in the sample space.

COMPLEMENT RULE

P(A′)=1−P(A)P(A') = 1 − P(A)

P(A') = probability that event A does not occur. This is often faster when counting "not A" outcomes is easier than counting A outcomes directly.

PROBABILITY BOUNDS

0≤P(A)≤10 ≤ P(A) ≤ 1

A probability of 0 means the event is impossible; a probability of 1 means it is certain. If your answer falls outside this range, recheck your counting.

💡

Sanity Check

After computing P(A), verify that P(A) + P(A') = 1. If the two values do not sum to exactly 1, you have miscounted either the event or the sample space. This check catches the majority of arithmetic errors on timed exams.

SECTION 5

Counting Strategies — Listing, Tables & Tree Diagrams

On test day, the challenge is rarely the probability formula itself—it is counting the outcomes correctly. Three practical strategies cover virtually every introductory probability scenario. The first is direct listing, which works when the sample space is small (roughly 20 outcomes or fewer). The second is constructing a two-way table (also called a grid), useful when an experiment involves two choices—such as rolling two dice or flipping a coin and rolling a die. The third is a tree diagram, which excels at tracking sequential stages where outcomes branch. The diagram below uses a tree to enumerate the sample space for flipping a coin and then rolling a standard die.

Tree Diagram: Flip a Coin, Then Roll a DieSample Space |S| = 12 equally likely outcomesStartHT123456123456(H, 1)(H, 2)(H, 3)(H, 4)(H, 5)(H, 6)(T, 1)(T, 2)(T, 3)(T, 4)(T, 5)(T, 6)Counting Principle2 × 6 = 12coin choices × die choices= total outcomesExample EventP(Heads and even)= 3/12 = 1/4
The tree diagram branches first on the coin flip (H or T), then on the die roll (1–6), producing 2 × 6 = 12 equally likely outcomes. The event "Heads and even number" corresponds to (H,2), (H,4), (H,6)—three outcomes out of twelve, giving P = 1/4.
StrategyBest WhenExample
Direct Listing|S| ≤ 20; outcomes are simple to write outRolling one die: S = {1, 2, 3, 4, 5, 6}
Two-Way TableTwo independent choices combine; grid layout keeps you organizedSum of two dice: 6 × 6 grid with 36 cells
Tree DiagramSequential stages; especially useful when stages have different numbers of branchesCoin flip then die roll: 2 branches → 6 sub-branches each
Multiplication Principle|S| is too large to list; stages are independent3-letter codes from 26 letters: 26 × 26 × 26 = 17,576

Counting strategies and when to use each one

SECTION 6

Worked Example — Drawing Cards

A standard deck of 52 playing cards contains 4 suits (hearts, diamonds, clubs, spades), each with 13 ranks (A, 2–10, J, Q, K). Hearts and diamonds are red; clubs and spades are black. Suppose you draw one card at random. What is the probability that you draw a face card (Jack, Queen, or King)?

P(Face Card) from a Standard Deck

  1. 1

    Step 1 — Identify the Experiment and Sample Space

    The experiment is drawing one card at random from a well-shuffled 52-card deck. Each card is equally likely to be drawn, so |S| = 52.
    |S| = 52
  2. 2

    Step 2 — Define the Event

    The event A is "the card drawn is a face card." Face cards are Jacks, Queens, and Kings. Each of the 4 suits contains exactly one J, one Q, and one K, so there are 3 face cards per suit.
    3 face cards × 4 suits = 12 face cards total
  3. 3

    Step 3 — Count Favorable Outcomes

    Listing them explicitly: J♥, Q♥, K♥, J♦, Q♦, K♦, J♣, Q♣, K♣, J♠, Q♠, K♠. That confirms |A| = 12.
    |A| = 12
  4. 4

    Step 4 — Apply the Formula

    P(A) = |A| / |S| = 12 / 52. Simplify by dividing numerator and denominator by their greatest common factor, which is 4.
    P(Face Card) = 12/52 = 3/13 ≈ 0.231
  5. 5

    Step 5 — Verify with the Complement

    Non-face cards number 52 − 12 = 40. P(not face card) = 40/52 = 10/13. Check: 3/13 + 10/13 = 13/13 = 1. ✓
    Complement check passes: 3/13 + 10/13 = 1 ✓

SECTION 7

Common Pitfalls & How to Avoid Them

Even students who understand the probability formula sometimes lose points because of counting errors or faulty assumptions. The table below catalogues the most frequent mistakes on ACCUPLACER-style problems and provides concrete strategies for avoiding each one.

PitfallWhy It HappensFix
Outcomes not equally likelyTreating a weighted spinner or biased coin as if outcomes are fairCheck the problem statement—if it says 'fair' or 'at random,' outcomes are equally likely. Otherwise, the formula P(A) = |A|/|S| does not directly apply.
Double-countingCounting an outcome that satisfies two conditions once for each conditionList outcomes explicitly or use the inclusion-exclusion principle: |A ∪ B| = |A| + |B| − |A ∩ B|.
Wrong sample space sizeForgetting that a standard deck has 52 cards (not 48 or 54) or that two dice produce 36 pairs (not 12)Memorize key sample spaces: 1 die = 6, 2 dice = 36, 1 coin = 2, deck = 52. Use the multiplication principle for combined experiments.
Not simplifying fractionsAnswer choices on the ACCUPLACER are usually in lowest termsAlways reduce: divide numerator and denominator by their GCF before comparing to the answer options.

Four common pitfalls in counting-based probability problems

⚠️

KEY TAKEAWAY

The number-one error is miscounting the sample space. Think of the sample space as the denominator in a fraction—if you get the denominator wrong, no amount of careful work on the numerator can save the answer. Before doing anything else, confirm |S| by using the multiplication principle or by listing outcomes systematically.

SECTION 8

Connection to Advanced Probability Concepts

The basic counting approach you have learned in this lesson is the gateway to more sophisticated probability ideas. While the ACCUPLACER focuses on straightforward single-stage experiments, recognizing where these concepts lead helps you see the bigger picture and prepares you for college-level statistics courses.

Basic Counting ConceptAdvanced Extension
P(A) = |A| / |S| with equally likely outcomesGeneral probability measure P(A) that handles unequal weights, continuous sample spaces, and infinite outcomes
Multiplication principle for countingPermutations (order matters) and Combinations (order doesn't), including nPr and nCr formulas
Complement rule: P(A') = 1 − P(A)Addition rule for unions: P(A ∪ B) = P(A) + P(B) − P(A ∩ B), and conditional probability P(A|B)
Listing outcomes in a tree diagramBayes' Theorem, which uses tree-diagram logic to reverse conditional probabilities

How basic counting concepts scale into advanced probability

For ACCUPLACER preparation, focus on mastering the counting ratio P(A) = |A| / |S| and the complement rule. These two tools, combined with careful enumeration of the sample space, will handle the vast majority of probability questions on the exam. Once you are comfortable with these, exploring permutations and combinations will feel like a natural next step rather than a conceptual leap.

SECTION 9

Practice Problems

Question 1: CONCEPTUAL

A jar contains only red and green gumballs. If the probability of drawing a red gumball at random is 0.6, what is the probability of drawing a green gumball? Explain your reasoning using the complement rule.
Show answer
Because red and green are the only two possibilities, drawing green is the complement of drawing red. By the complement rule, P(green) = 1 − P(red) = 1 − 0.6 = 0.4. This works because the probabilities of all possible outcomes in a sample space must sum to exactly 1, and since there are only two colors, P(red) + P(green) = 1.

Question 2: BASIC CALCULATION

A bag contains 5 blue marbles, 3 yellow marbles, and 2 white marbles. If you draw one marble at random, what is the probability that it is yellow?
Show answer
The total number of marbles is |S| = 5 + 3 + 2 = 10. The event A = {yellow marble} has |A| = 3. Therefore P(yellow) = |A| / |S| = 3/10 = 0.3. Each marble is equally likely to be drawn because the problem says 'at random,' confirming that the classical formula applies directly.

Question 3: INTERMEDIATE

A fair six-sided die is rolled once. What is the probability of rolling a number that is either even or greater than 4? Be careful not to double-count.
Show answer
Even outcomes are {2, 4, 6} and outcomes greater than 4 are {5, 6}. The union is {2, 4, 5, 6}, which has 4 elements. Note that 6 appears in both sets, so listing the union avoids double-counting. Alternatively, use inclusion-exclusion: |even| + |>4| − |even AND >4| = 3 + 2 − 1 = 4. Therefore P(even or >4) = 4/6 = 2/3 ≈ 0.667.

Question 4: APPLIED

A class has 12 boys and 18 girls. The teacher writes each student's name on a slip of paper and draws one slip at random to win a prize. If 5 of the boys and 7 of the girls are wearing glasses, what is the probability that the winner wears glasses?
Show answer
The sample space is all 30 students: |S| = 12 + 18 = 30. The event A = {student wearing glasses} includes 5 boys and 7 girls, so |A| = 5 + 7 = 12. Therefore P(glasses) = 12/30 = 2/5 = 0.4. The key insight is that you count all students with glasses regardless of gender—the favorable outcomes from different subgroups simply add together because no student is counted in both subgroups.

Question 5: CRITICAL THINKING

You flip a fair coin and roll a fair six-sided die simultaneously. What is the probability that you get Heads and a prime number? Construct a partial tree diagram or outcome list to justify your answer, and explain why the multiplication principle gives the same sample-space size.
Show answer
The sample space has |S| = 2 × 6 = 12 outcomes by the multiplication principle: each of 2 coin results pairs with each of 6 die results. The prime numbers on a standard die are {2, 3, 5}—three values. The favorable outcomes pairing Heads with a prime are (H,2), (H,3), (H,5), giving |A| = 3. Therefore P(Heads and prime) = 3/12 = 1/4 = 0.25. The multiplication principle works here because the coin and die are independent—the result of one does not affect the other—so every combination is equally likely and the total count is the product of individual stage counts.

SUMMARY

Lesson Summary

Summary

Basic counting for probability centers on one powerful idea: when outcomes are equally likely, the probability of an event equals the number of favorable outcomes divided by the total number of outcomes in the sample space. The formula P(A) = |A| / |S| is your primary tool, and the complement rule P(A') = 1 − P(A) serves as both a shortcut and a verification check.

To count correctly, choose the right strategy for the problem: direct listing for small sample spaces, tree diagrams for sequential experiments, two-way tables for two-factor experiments, and the multiplication principle when the sample space is large but structured. Watch for common pitfalls—especially miscounting the sample space and double-counting overlapping events—and always reduce your final fraction to lowest terms before selecting an answer on the ACCUPLACER.

Varsity Tutors • ACCUPLACER Quantitative Reasoning, Algebra & Statistics • Basic Counting for Probability