Study guide

10.1 Theoretical vs. Experimental Probability, Sample Spaces, & Single-Event Outcomes

TABE Mathematics Exam

Track your progress as you read

Finished sections get a check mark.

1 Exam Structure, Administration, Locator & NRS Scoring

1.1 TABE 13&14 Mathematics: Levels, Structure, & Administration 1.2 Scale Scores, NRS Levels, Out-of-Range Flags, & Measurable Skills Gains

2 Chapter 2: Number Operations in Base Ten & Number Systems

2.1 Whole Number Place Value, Multi-Digit Arithmetic, & Estimation 2.2 Decimal Operations, Place Value, & Practical Applications 2.3 Factors, Multiples, Divisibility Rules, & Prime Factorization 2.4 Meanings of Multiplication and Division: Equal Groups, Arrays, & Multiplicative Comparison 2.5 One-Step and Two-Step Word Problems with Unknown Quantities

3 Chapter 3: Fractions, Rational Numbers, & Signed Integers

3.1 Fraction Fundamentals, Equivalence, & Mixed Numbers 3.2 Fraction Arithmetic: Adding, Subtracting, Multiplying, & Dividing 3.3 Integers, Absolute Value, & Signed Rational Number Operations 3.4 Fraction Multiplication as Scaling, Unit-Fraction Division, & Fractions in Measurement

4 Chapter 4: Ratios, Proportions, & Percents

4.1 Ratios, Rates, Unit Rates, & Proportional Relationships 4.2 Percents: Triad Conversions, Percent Equations, & Base Calculations 4.3 Real-World Percent Applications: Tax, Discounts, Markups, Interest, & Percent Change 4.4 Ratio Reasoning with Tables, Tape Diagrams, & Double Number Lines

5 Chapter 5: Expressions and Algebraic Thinking

5.1 Arithmetic Patterns, Variables, & Translating Algebraic Expressions 5.2 Evaluating Expressions, Order of Operations, & Properties of Operations 5.3 Exponents, Square & Cube Roots, Radicals, & Scientific Notation 5.4 Independent and Dependent Variables, Tables, & Two-Quantity Relationships 5.5 Equivalent Expressions, Expression Structure, & Justifying Every Step 5.6 Radicals, Rational Exponents, & Approximating Irrational Numbers

6 Chapter 6: Equations and Inequalities

6.1 Solving One-Step & Two-Step Linear Equations 6.2 Multi-Step Equations, Variables on Both Sides, & Special Solution Sets 6.3 Linear Inequalities: Solving, Graphing on Number Lines, & Word Problems 6.4 Systems of Linear Equations: Graphing, Substitution, & Elimination Methods 6.5 Literal Equations & Rearranging Formulas 6.6 Creating Equations, Inequalities, & Constraint Models

7 Chapter 7: Advanced Algebra & Quadratic Equations

7.1 Polynomial Operations: Addition, Subtraction, & Multiplication 7.2 Factoring Polynomials & Solving Quadratic Equations by Factoring 7.3 The Quadratic Formula, Completing the Square, & Graphs of Quadratics

8 Chapter 8: Functions & Mathematical Modeling

8.1 Function Fundamentals, Notation, Domain, & Range 8.2 Linear Functions: Slope, Rate of Change, & Linear Equations 8.3 Exponential Growth & Decay Models, & Comparing Function Families 8.4 Building Functions & Interpreting Parameters in Context 8.5 Average Rate of Change, Qualitative Graphs, & Comparing Representations

9 Chapter 9: Measurement, Unit Conversions, & Statistical Displays

9.1 Customary & Metric Unit Conversions and Dimensional Analysis 9.2 Frequency Tables, Bar Graphs, Line Graphs, & Histograms 9.3 Measures of Central Tendency & Statistical Dispersion 9.4 Five-Number Summaries, Box Plots, & Bivariate Scatter Plots 9.5 Telling Time, Elapsed Time, & Money Calculations 9.6 Measuring and Estimating Length, Mass, & Liquid Volume 9.7 Line Plots, Dot Plots, & Picture Graphs 9.8 Units, Quantities, Precision, & Appropriate Accuracy

10 Chapter 10: Probability & Statistical Inferences

10.1 Theoretical vs. Experimental Probability, Sample Spaces, & Single-Event Outcomes 10.2 Compound Probability: Independent Events, Dependent Events, & Addition Rules 10.3 Sampling Techniques, Bias, & Making Population Inferences 10.4 Statistical Questions, Variability, & Describing Distributions 10.5 Probability Models, Relative Frequency, & Simulation

11 Chapter 11: Two-Dimensional Geometry & Spatial Reasoning

11.1 Geometric Fundamentals: Points, Lines, Angles, Angle Relationships, & Polygons 11.2 Perimeter of Polygons, Circle Anatomy, & Circumference Calculations 11.3 Area Formulas & Area of Composite Figures 11.4 Angle Measurement, Protractors, & Angle Addition 11.5 Classifying Two-Dimensional Figures & Partitioning Shapes into Equal Parts 11.6 Area by Tiling, Unit Squares, & the Distributive Property of Area

12 Chapter 12: Three-Dimensional Geometry, Coordinate Geometry, & Right Triangles

12.1 Volume and Surface Area of 3D Solids 12.2 Coordinate Geometry: Distance, Midpoint, & Geometric Transformations 12.3 The Pythagorean Theorem, Geometric Similarity, & Indirect Measurement 12.4 Volume by Unit Cubes & Additive Volume of Composite Solids 12.5 The Coordinate Plane: Plotting Points, Quadrants, & Polygons on the Grid 12.6 Density & Geometric Modeling

10.1 Theoretical vs. Experimental Probability, Sample Spaces, & Single-Event Outcomes

Key Takeaways Explain This Topic AI

Probability quantifies the likelihood of an event occurring along a continuous scale from 0 (impossible) to 1 (certain), expressible interchangeably as simplified fractions, decimals, or percentages.

Theoretical probability calculates likelihood based on idealized, equally likely outcomes (P(E) = Favorable Outcomes / Total Possible Outcomes), whereas experimental probability reflects observed empirical trials (P(exp) = Occurrences / Total Trials).

The Law of Large Numbers dictates that as the number of experimental trials increases, the empirical relative frequency converges toward the true theoretical probability.

The Fundamental Counting Principle determines the total size of a sample space by multiplying outcome counts across successive stages (m × n × p), while complementary probability (P(A') = 1 - P(A)) simplifies calculations for 'not' and 'at least one' conditions.

Last updated: August 2026

10.1 Theoretical vs. Experimental Probability, Sample Spaces, & Single-Event Outcomes

Probability is the branch of mathematics that quantifies uncertainty, measuring the chance or likelihood that a specific event will happen. On the TABE 13&14 Mathematics assessment (Levels M, D, and A), probability problems test your ability to model single-stage experiments, calculate exact theoretical ratios, evaluate empirical data from experimental trials, construct sample spaces, and apply the Fundamental Counting Principle.

The Likelihood Scale & Numerical Representation

The probability of any event E E E , denoted as P ( E ) P(E) P ( E ) , is a real number bounded strictly between 0 0 0 and 1 1 1 , inclusive: 0 ≤ P ( E ) ≤ 1 0 \le P(E) \le 1 0 ≤ P ( E ) ≤ 1

Probabilities can be represented interchangeably in three mathematical formats: simplified fractions , decimals , and percentages .

  • Likelihood Descriptor Probability Value Fraction Decimal Percentage Practical Example
  • Impossible 0 0 0 0 1 \frac{0}{1} 1 0 ​ 0.00 0.00 0.00 0 % 0\% 0% Rolling an 8 8 8 on a standard 6-sided die

Unlikely > 0 > 0 > 0 and < 0.5 < 0.5 < 0.5 1 4 \frac{1}{4} 4 1 ​ 0.25 0.25 0.25 25 % 25\% 25% Drawing a Heart from a standard 52-card deck

Equally Likely as Not (Even Chance) 0.5 0.5 0.5 1 2 \frac{1}{2} 2 1 ​ 0.50 0.50 0.50 50 % 50\% 50% Tossing a coin and landing on Heads

Likely > 0.5 > 0.5 > 0.5 and < 1.0 < 1.0 < 1.0 3 4 \frac{3}{4} 4 3 ​ 0.75 0.75 0.75 75 % 75\% 75% Rolling a number greater than 1 1 1 on a 6-sided die

Certain 1 1 1 1 1 \frac{1}{1} 1 1 ​ 1.00 1.00 1.00 100 % 100\% 100% Rolling a number less than 7 7 7 on a 6-sided die

Important

The Sum of Elementary Probabilities: In any valid probability experiment, the sum of the probabilities of all distinct, non-overlapping simple outcomes in the sample space must equal exactly 1 1 1 (or 100 % 100\% 100% ): ∑ P ( e i ) = P ( e 1 ) + P ( e 2 ) + ⋯ + P ( e n ) = 1 \sum P(e_i) = P(e_1) + P(e_2) + \dots + P(e_n) = 1 ∑ P ( e i ​ ) = P ( e 1 ​ ) + P ( e 2 ​ ) + ⋯ + P ( e n ​ ) = 1

Theoretical Probability of Single Events

Theoretical probability is calculated mathematically under the assumption that all possible outcomes in an experiment are equally likely (fair). It represents the expected likelihood before any physical trials occur.

The Theoretical Probability Formula P ( E ) = n ( E ) n ( S ) = Number of Favorable Outcomes Total Number of Possible Outcomes in Sample Space P(E) = \frac{n(E)}{n(S)} = \frac{\text{Number of Favorable Outcomes}}{\text{Total Number of Possible Outcomes in Sample Space}} P ( E ) = n ( S ) n ( E ) ​ = Total Number of Possible Outcomes in Sample Space Number of Favorable Outcomes ​

Standard Probability Models on TABE

Standard 6-Sided Die: Outcomes S = { 1 , 2 , 3 , 4 , 5 , 6 } S = \{1, 2, 3, 4, 5, 6\} S = { 1 , 2 , 3 , 4 , 5 , 6 } , where each number has P = 1 6 P = \frac{1}{6} P = 6 1 ​ .

Standard 52-Card Deck: 52 52 52 total cards, split into 2 2 2 colors (Red 26 26 26 , Black 26 26 26 ), 4 4 4 suits ( 13 13 13 Hearts, 13 13 13 Diamonds, 13 13 13 Spades, 13 13 13 Clubs), and 3 3 3 face cards per suit (Jack, Queen, King ⟹ 12 \implies 12 ⟹ 12 total face cards).

Fair Spinners & Urns: Circular wheels partitioned into congruent sectors or containers with colored marbles/tokens.

Worked Example 1: Standard Card Deck Selection

Problem: A single card is drawn at random from a standard, shuffled 52-card deck. What is the theoretical probability of drawing a red face card ?

Identify the Sample Space Size: n ( S ) = 52 n(S) = 52 n ( S ) = 52 .

Count Favorable Outcomes: Face cards are Jacks, Queens, and Kings. There are 3 3 3 red Hearts face cards and 3 3 3 red Diamonds face cards ⟹ n ( Red Face ) = 3 + 3 = 6 \implies n(\text{Red Face}) = 3 + 3 = 6 ⟹ n ( Red Face ) = 3 + 3 = 6 .

Apply the Formula & Simplify: P ( Red Face ) = 6 52 = 3 26 ≈ 0.1154 = 11.54 % P(\text{Red Face}) = \frac{6}{52} = \frac{3}{26} \approx 0.1154 = \mathbf{11.54\%} P ( Red Face ) = 52 6 ​ = 26 3 ​ ≈ 0.1154 = 11.54%

Worked Example 2: Prime Numbers on a Die

Problem: A standard fair six-sided die is rolled once. What is the probability of rolling a prime number?

Sample Space: S = { 1 , 2 , 3 , 4 , 5 , 6 } ⟹ n ( S ) = 6 S = \{1, 2, 3, 4, 5, 6\} \implies n(S) = 6 S = { 1 , 2 , 3 , 4 , 5 , 6 } ⟹ n ( S ) = 6 .

Identify Prime Outcomes: Prime numbers have exactly two distinct positive divisors ( 1 1 1 and itself). Primes in S S S are { 2 , 3 , 5 } \{2, 3, 5\} { 2 , 3 , 5 } (note that 1 1 1 is neither prime nor composite) ⟹ n ( Prime ) = 3 \implies n(\text{Prime}) = 3 ⟹ n ( Prime ) = 3 .

Calculate: P ( Prime ) = 3 6 = 1 2 = 0.50 = 50 % P(\text{Prime}) = \frac{3}{6} = \frac{1}{2} = \mathbf{0.50 = 50\%} P ( Prime ) = 6 3 ​ = 2 1 ​ = 0.50 = 50%

Experimental Probability & The Law of Large Numbers

Experimental probability (empirical probability) is calculated from the observed results of an actual experiment or historical data collection.

The Experimental Probability Formula P ( exp ) = Number of Times the Event Occurred Total Number of Trials Conducted P(\text{exp}) = \frac{\text{Number of Times the Event Occurred}}{\text{Total Number of Trials Conducted}} P ( exp ) = Total Number of Trials Conducted Number of Times the Event Occurred ​

  • Attribute Theoretical Probability Experimental (Empirical) Probability
  • Basis Mathematical rules & geometric symmetry Real-world physical trials or historical data
  • Timing Determined before any experiment runs Computed after data collection concludes
  • Variability Constant and unchanging for a given model Varies from one trial batch to another

Application Games of chance, ideal physics, lotteries Quality control, weather forecasting, insurance actuarial tables

The Law of Large Numbers (LLN)

The Law of Large Numbers states that as the number of repetitions or trials in a probability experiment increases ( n → ∞ n \to \infty n → ∞ ), the relative frequency (experimental probability) gets closer and closer to the theoretical probability. Law of Large Numbers (Coin Toss Relative Frequency Convergence):

  • Relative Frequency of Heads
  • 1.0 | *
  • 0.8 | *
  • 0.6 | * * * ---------------------------- Theoretical P(Heads) = 0.50
  • 0.4 | * * * * * * * * * * * * * * *
  • 0.2 |
  • 0.0 +-------------------------------------------
  • 0 10 50 100 250 500 1,000 5,000 10,000 (Number of Trials n)
  • Worked Example 3: Quality Control Defect Prediction

Problem: A manufacturing plant tests 400 400 400 computer motherboards and discovers 18 18 18 have defective solder joints. If the factory produces 14 , 000 14,000 14 , 000 motherboards this month, what is the best estimate of the total number of defective motherboards produced?

Calculate the Experimental Probability: P ( Defective ) = 18 400 = 9 200 = 0.045 = 4.5 % P(\text{Defective}) = \frac{18}{400} = \frac{9}{200} = 0.045 = 4.5\% P ( Defective ) = 400 18 ​ = 200 9 ​ = 0.045 = 4.5%

Multiply by the Total Batch Volume: Estimated Defects = P ( Defective ) × Total Batch = 0.045 × 14 , 000 = 630 motherboards \text{Estimated Defects} = P(\text{Defective}) \times \text{Total Batch} = 0.045 \times 14,000 = \mathbf{630\text{ motherboards}} Estimated Defects = P ( Defective ) × Total Batch = 0.045 × 14 , 000 = 630 motherboards

Sample Spaces & Systematic Counting Models

A sample space ( S S S ) is the comprehensive set containing all possible outcomes of a probability experiment.

Methods for Representing Sample Spaces

Roster Notation (Listing): Explicitly listing all elements inside set brackets: S = { H , T } S = \{H, T\} S = { H , T } .

Two-Dimensional Outcome Grids: A grid mapping the outcomes of two simultaneous stages.

Tree Diagrams: A branching visualization showing sequential stages and path probabilities. Two-Stage Tree Diagram (Tossing a Coin then Rolling a 4-Sided Die):

  • Stage 1 (Coin) Stage 2 (Die) Outcome Path
  • ├── 1 -------------> (H, 1)
  • ├── 2 -------------> (H, 2)
  • ├── Heads ────┼── 3 -------------> (H, 3)
  • │ └── 4 -------------> (H, 4)
  • Start ──┤
  • │ ├── 1 -------------> (T, 1)
  • │ ├── 2 -------------> (T, 2)
  • └── Tails ────┼── 3 -------------> (T, 3)
  • └── 4 -------------> (T, 4)
  • Total Outcomes in Sample Space = 2 × 4 = 8
  • Outcome Grid for Rolling Two Standard Six-Sided Dice ( 36 36 36 Outcomes)

When rolling two dice (Die 1 along rows, Die 2 along columns), the sum of the two faces produces the classic triangular distribution:

Die 1 \ Die 2 1 2 3 4 5 6

1 ( 1 , 1 ) = 2 (1,1)=2 ( 1 , 1 ) = 2 ( 1 , 2 ) = 3 (1,2)=3 ( 1 , 2 ) = 3 ( 1 , 3 ) = 4 (1,3)=4 ( 1 , 3 ) = 4 ( 1 , 4 ) = 5 (1,4)=5 ( 1 , 4 ) = 5 ( 1 , 5 ) = 6 (1,5)=6 ( 1 , 5 ) = 6 ( 1 , 6 ) = 7 (1,6)=7 ( 1 , 6 ) = 7

2 ( 2 , 1 ) = 3 (2,1)=3 ( 2 , 1 ) = 3 ( 2 , 2 ) = 4 (2,2)=4 ( 2 , 2 ) = 4 ( 2 , 3 ) = 5 (2,3)=5 ( 2 , 3 ) = 5 ( 2 , 4 ) = 6 (2,4)=6 ( 2 , 4 ) = 6 ( 2 , 5 ) = 7 (2,5)=7 ( 2 , 5 ) = 7 ( 2 , 6 ) = 8 (2,6)=8 ( 2 , 6 ) = 8

3 ( 3 , 1 ) = 4 (3,1)=4 ( 3 , 1 ) = 4 ( 3 , 2 ) = 5 (3,2)=5 ( 3 , 2 ) = 5 ( 3 , 3 ) = 6 (3,3)=6 ( 3 , 3 ) = 6 ( 3 , 4 ) = 7 (3,4)=7 ( 3 , 4 ) = 7 ( 3 , 5 ) = 8 (3,5)=8 ( 3 , 5 ) = 8 ( 3 , 6 ) = 9 (3,6)=9 ( 3 , 6 ) = 9

4 ( 4 , 1 ) = 5 (4,1)=5 ( 4 , 1 ) = 5 ( 4 , 2 ) = 6 (4,2)=6 ( 4 , 2 ) = 6 ( 4 , 3 ) = 7 (4,3)=7 ( 4 , 3 ) = 7 ( 4 , 4 ) = 8 (4,4)=8 ( 4 , 4 ) = 8 ( 4 , 5 ) = 9 (4,5)=9 ( 4 , 5 ) = 9 ( 4 , 6 ) = 10 (4,6)=10 ( 4 , 6 ) = 10

5 ( 5 , 1 ) = 6 (5,1)=6 ( 5 , 1 ) = 6 ( 5 , 2 ) = 7 (5,2)=7 ( 5 , 2 ) = 7 ( 5 , 3 ) = 8 (5,3)=8 ( 5 , 3 ) = 8 ( 5 , 4 ) = 9 (5,4)=9 ( 5 , 4 ) = 9 ( 5 , 5 ) = 10 (5,5)=10 ( 5 , 5 ) = 10 ( 5 , 6 ) = 11 (5,6)=11 ( 5 , 6 ) = 11

6 ( 6 , 1 ) = 7 (6,1)=7 ( 6 , 1 ) = 7 ( 6 , 2 ) = 8 (6,2)=8 ( 6 , 2 ) = 8 ( 6 , 3 ) = 9 (6,3)=9 ( 6 , 3 ) = 9 ( 6 , 4 ) = 10 (6,4)=10 ( 6 , 4 ) = 10 ( 6 , 5 ) = 11 (6,5)=11 ( 6 , 5 ) = 11 ( 6 , 6 ) = 12 (6,6)=12 ( 6 , 6 ) = 12

TABE Question Application: What is the probability of rolling a sum of 7 7 7 with two dice? There are 6 6 6 favorable diagonal pairs: ( 1 , 6 ) , ( 2 , 5 ) , ( 3 , 4 ) , ( 4 , 3 ) , ( 5 , 2 ) , ( 6 , 1 ) (1,6), (2,5), (3,4), (4,3), (5,2), (6,1) ( 1 , 6 ) , ( 2 , 5 ) , ( 3 , 4 ) , ( 4 , 3 ) , ( 5 , 2 ) , ( 6 , 1 ) . Thus, P ( Sum of 7 ) = 6 36 = 1 6 P(\text{Sum of } 7) = \frac{6}{36} = \frac{1}{6} P ( Sum of 7 ) = 36 6 ​ = 6 1 ​ .

The Fundamental Counting Principle

The Fundamental Counting Principle (Multiplication Counting Principle) states that if a compound process can be broken down into k k k consecutive independent stages, where Stage 1 has n 1 n_1 n 1 ​ possible outcomes, Stage 2 has n 2 n_2 n 2 ​ possible outcomes, and Stage k k k has n k n_k n k ​ possible outcomes, the total number of distinct combined outcomes is the product of the individual stage counts: Total Outcomes = n 1 × n 2 × n 3 × ⋯ × n k \mathbf{\text{Total Outcomes} = n_1 \times n_2 \times n_3 \times \dots \times n_k} Total Outcomes = n 1 ​ × n 2 ​ × n 3 ​ × ⋯ × n k ​

Worked Example 4: Security Passcode Creation

Problem: A warehouse security gate requires a 4-character employee access code. The first character must be a letter from A A A through E E E (5 options). The remaining three characters are single-digit numbers ( 0 0 0 through 9 9 9 ). How many unique passcodes can be created if (a) digits may repeat, and (b) digits cannot repeat?

Case A: Repetition Allowed Total Codes = 5 × 10 × 10 × 10 = 5 , 000 codes \text{Total Codes} = 5 \times 10 \times 10 \times 10 = \mathbf{5,000\text{ codes}} Total Codes = 5 × 10 × 10 × 10 = 5 , 000 codes

Case B: No Digits Repeated Total Codes = 5 × 10 × 9 × 8 = 3 , 600 codes \text{Total Codes} = 5 \times 10 \times 9 \times 8 = \mathbf{3,600\text{ codes}} Total Codes = 5 × 10 × 9 × 8 = 3 , 600 codes

Complementary Events & The "At Least One" Rule

The complement of an event A A A , denoted A ′ A' A ′ (or A c A^c A c or not A \text{not } A not A ), consists of all outcomes in the sample space S S S that are not contained in event A A A . P ( A ) + P ( A ′ ) = 1 ⟺ P ( A ′ ) = 1 − P ( A ) \mathbf{P(A) + P(A') = 1} \qquad \Longleftrightarrow \qquad \mathbf{P(A') = 1 - P(A)} P ( A ) + P ( A ′ ) = 1 ⟺ P ( A ′ ) = 1 − P ( A )

Worked Example 5: Probability of Complementary Events

Problem: A game spinner is divided into 10 10 10 equal sectors: 4 4 4 red, 3 3 3 blue, 2 2 2 yellow, and 1 1 1 green. What is the probability of spinning the arrow and landing on a color that is not red ?

Find P ( Red ) : P ( Red ) = 4 10 = 0.40 P(\text{Red}): P(\text{Red}) = \frac{4}{10} = 0.40 P ( Red ) : P ( Red ) = 10 4 ​ = 0.40 .

Apply the complement formula: P ( Not Red ) = 1 − P ( Red ) = 1 − 4 10 = 6 10 = 3 5 = 0.60 = 60 % P(\text{Not Red}) = 1 - P(\text{Red}) = 1 - \frac{4}{10} = \frac{6}{10} = \frac{3}{5} = \mathbf{0.60 = 60\%} P ( Not Red ) = 1 − P ( Red ) = 1 − 10 4 ​ = 10 6 ​ = 5 3 ​ = 0.60 = 60%

The "At Least One" Rule

When solving complex multi-stage problems where calculating direct probabilities requires summing many branches, the complement provides an efficient shortcut: P ( At Least One Success ) = 1 − P ( Zero Successes ) \mathbf{P(\text{At Least One Success}) = 1 - P(\text{Zero Successes})} P ( At Least One Success ) = 1 − P ( Zero Successes )

Loading diagram... Single-Event Probability Foundations