Study guide

14.4 Probability Principles, Counting Techniques, Permutations, Combinations, and Tree Diagrams

FTCE General Knowledge Test 082

Track your progress as you read

Finished sections get a check mark.

1 Chapter 1: Exam Overview, Florida Certification Framework & Logistics

1.1 Florida Teacher Certification Framework & The Basic Skills Requirement 1.2 Subtest Structure, Appointment Scheduling, Fees, and Retake Policies 1.3 Computer-Based Testing Interface, Provided Tools, and Scoring Standards

2 Chapter 2: Subtest 1: Essay (825) — Writing, Organization, and Argumentation

2.1 Prompt Analysis, Mode Selection, and Formulating a Defensible Thesis Statement 2.2 Multi-Paragraph Organizational Structure, Logical Reasoning, and Evidence Integration 2.3 Transitional Techniques, Cohesive Devices, and Effective Conclusions 2.4 College-Level Conventions, Voice, Point of View, and Holistic Scoring Rubric

3 Chapter 3: Subtest 2: English Language Skills (826) — Language Structure

3.1 Correct Placement of Modifiers: Misplaced, Dangling, and Squinting Modifiers 3.2 Faulty Parallelism in Series, Correlative Conjunctions, and Comparisons 3.3 Sentence Variety and Boundary Mechanics: Clauses, Coordination, and Boundary Errors 3.4 Organizational Patterns and Text Structures in Written Passages

4 Chapter 4: Subtest 2: English Language Skills (826) — Vocabulary Application

4.1 Determining Word Meaning, Connotative Nuances, and Multiple-Meaning Words in Context 4.2 Commonly Confused Words, Frequently Misused Pairs, and Standard Idiomatic Usage 4.3 Diction, Register, and Tone for Academic and Professional Audiences

5 Chapter 5: Subtest 2: English Language Skills (826) — Verbs and Agreement

5.1 Standard Verb Forms, Irregular Verbs, and Subjunctive/Conditional Moods 5.2 Verb Tense Consistency and Unwarranted Tense Shifts in Discourse 5.3 Subject-Verb Agreement: Intervening Prepositional Phrases, Inverted Sentences, and Compound Subjects 5.4 Pronoun-Antecedent Agreement: Number, Indefinite Pronouns, and Collective Nouns

6 Chapter 6: Subtest 2: English Language Skills (826) — Pronouns, Modifiers, and Mechanics

6.1 Pronoun Case, Who vs. Whom, Clear References, and Pronoun Shifts 6.2 Adjectives and Adverbs: Usage, Degrees of Comparison, and Modifying Clauses 6.3 Punctuation: Commas, Semicolons, Colons, Dashes, Hyphens, and Apostrophes 6.4 Capitalization Rules, High-Frequency Spelling Conventions, and Homophones

7 Chapter 7: Subtest 3: Reading (827) — Key Ideas and Details

7.1 Citing Textual Evidence and Identifying Explicit Details 7.2 Distinguishing Between Inferences, Assumptions, and Valid Conclusions 7.3 Determining Central Ideas and Writing Objective Summaries 7.4 Analyzing the Development of Relationships Between Individuals, Events, and Ideas

8 Chapter 8: Subtest 3: Reading (827) — Craft and Structure

8.1 Interpreting Figurative, Connotative, and Domain-Specific Academic Language 8.2 Analyzing How Specific Word Choices Establish Tone, Mood, and Connotation 8.3 Analyzing Text Structures, Structural Moves, and Informational Features 8.4 Analyzing Author Perspective, Point of View, Underlying Purpose, and Rhetorical Bias

9 Chapter 9: Subtest 3: Reading (827) — Integration of Knowledge and Ideas

9.1 Integrating and Evaluating Information Presented in Diverse and Multi-Modal Formats 9.2 Evaluating Claims, Argumentative Validity, Relevancy, and Sufficiency of Evidence 9.3 Synthesizing Information Across Multiple Texts to Explain Concepts or Processes 9.4 Comparing and Contrasting Authors' Approaches to Related Topics and Themes

10 Chapter 10: Subtest 4: Mathematics (828) — Number Sense, Concepts, and Operations

10.1 Real Number Classifications, Properties, and Number Line Placement 10.2 Operations with Rational Numbers: Fractions, Decimals, Percents, and Mixed Numbers 10.3 Financial Literacy and Real-World Applications: Interest, Sales Tax, Discounts, and Percent Change 10.4 Order of Operations (PEMDAS), Grouping Symbols, and Evaluating Numerical Expressions

11 Chapter 11: Subtest 4: Mathematics (828) — Geometry and Measurement

11.1 Classifying 2D and 3D Figures, Angle Relationships, and Geometric Properties 11.2 Perimeter, Circumference, Area, Surface Area, and Volume Calculations 11.3 Ratio, Proportion, Scale Drawings, and Geometric Similarity 11.4 Choosing Measurement Units, Unit Conversions, Derived Rates, and Scientific Notation

12 Chapter 12: Subtest 4: Mathematics (828) — Algebraic Thinking: Expressions & Equations

12.1 Algebraic Equivalence, Field Properties, and Simplifying Expressions 12.2 Modeling Real-World Scenarios with Expressions, Equations, and Inequalities 12.3 Solving Linear and Quadratic Equations and Inequalities Algebraically and Graphically

13 Chapter 13: Subtest 4: Mathematics (828) — Algebraic Thinking: Functions, Slopes & Models

13.1 Linear Equations, Slopes, Intercepts, and Interpreting Key Features 13.2 Comparing Slopes, Rates of Change, and Parallel vs. Perpendicular Lines 13.3 Relations and Functions: Domain, Range, and Non-Linear Models

14 Chapter 14: Subtest 4: Mathematics (828) — Probability, Statistics, and Data Interpretation

14.1 Reading and Interpreting Histograms, Circle Graphs, Scatterplots, and Two-Way Tables 14.2 Graphical Distortion, Biased Scaling, and Inappropriate Statistical Choices 14.3 Measures of Central Tendency and Variability in Real-World Contexts 14.4 Probability Principles, Counting Techniques, Permutations, Combinations, and Tree Diagrams

14.4 Probability Principles, Counting Techniques, Permutations, Combinations, and Tree Diagrams

Key Takeaways Explain This Topic AI

The Fundamental Counting Principle establishes that if a multi-stage process has k sequential stages with n₁, n₂, ..., nₖ outcomes, the total number of compound outcomes is n₁ × n₂ × ... × nₖ.

Permutations quantify arrangements where positional sequence matters (P(n, r) = n! / (n - r)!), whereas Combinations quantify selections where order does not matter (C(n, r) = n! / [r!(n - r)!]).

Theoretical probability of an event E in an equiprobable sample space is P(E) = n(E) / n(S), bounded between 0 and 1, with complementary probability P(not E) = 1 - P(E).

Compound independent events satisfy the multiplication rule P(A and B) = P(A) × P(B), whereas dependent events require updating the sample space conditionally: P(A and B) = P(A) × P(B|A).

The Addition Rule for overlapping (non-mutually exclusive) events subtracts the joint intersection to prevent double counting: P(A or B) = P(A) + P(B) - P(A and B).

Last updated: September 2026

14.4 Probability Principles, Counting Techniques, Permutations, Combinations, and Tree Diagrams

Competency 4.4 of the FTCE General Knowledge Mathematics subtest evaluates an educator's mastery of counting techniques, combinatorial principles, and probability theory. Test items present candidates with real-world scenarios requiring them to calculate sample spaces, evaluate factorials, distinguish between order-dependent and order-independent groupings, and compute exact probabilities for simple, compound, independent, and dependent events.

The Fundamental Counting Principle and Factorials

Determining the total number of possible outcomes in a multi-stage experiment is the starting point for probability calculations.

The Fundamental Counting Principle

If a composite event consists of k k k sequential stages, where the first stage can occur in n 1 n_1 n 1 ​ ways, the second in n 2 n_2 n 2 ​ ways, the third in n 3 n_3 n 3 ​ ways, and so on, the total number of possible outcomes ( N N N ) is the product of the number of choices at each stage: N = n 1 × n 2 × n 3 × ⋯ × n k N = n_1 \times n_2 \times n_3 \times \dots \times n_k N = n 1 ​ × n 2 ​ × n 3 ​ × ⋯ × n k ​

Example (Student ID Codes) : A school creates a student identification code consisting of 2 letters followed by 3 single-digit numbers (digits 0–9). If letters and digits may repeat, the total possible codes is: N = 26 × 26 × 10 × 10 × 10 = 676 × 1 , 000 = 676 , 000 N = 26 \times 26 \times 10 \times 10 \times 10 = 676 \times 1,000 = 676,000 N = 26 × 26 × 10 × 10 × 10 = 676 × 1 , 000 = 676 , 000

If repetition is prohibited: N = 26 × 25 × 10 × 9 × 8 = 650 × 720 = 468 , 000 N = 26 \times 25 \times 10 \times 9 \times 8 = 650 \times 720 = 468,000 N = 26 × 25 × 10 × 9 × 8 = 650 × 720 = 468 , 000

Factorials

A factorial (denoted n ! n! n ! ) represents the product of all positive integers less than or equal to n n n : n ! = n × ( n − 1 ) × ( n − 2 ) × ⋯ × 3 × 2 × 1 n! = n \times (n - 1) \times (n - 2) \times \dots \times 3 \times 2 \times 1 n ! = n × ( n − 1 ) × ( n − 2 ) × ⋯ × 3 × 2 × 1

Special Axiom : By mathematical convention, 0 ! = 1 0! = 1 0 ! = 1 (representing the single way to arrange an empty set).

Common factorials: 1 ! = 1 1! = 1 1 ! = 1 , 2 ! = 2 2! = 2 2 ! = 2 , 3 ! = 6 3! = 6 3 ! = 6 , 4 ! = 24 4! = 24 4 ! = 24 , 5 ! = 120 5! = 120 5 ! = 120 , 6 ! = 720 6! = 720 6 ! = 720 .

Permutations vs. Combinations: The Order Test

The most critical conceptual decision on FTCE counting problems is determining whether an arrangement constitutes a permutation or a combination . THE ORDER DECISION CRITERION

Does positional ORDER matter?

  • ┌───────────────┐
  • │ Selection of │
  • │ r from n │
  • └───────┬───────┘
  • ┌───────────────────────┴───────────────────────┐
  • ▼ ▼
  • YES: ORDER MATTERS NO: ORDER DOES NOT MATTER
  • ┌───────────────────────┐ ┌───────────────────────┐
  • │ PERMUTATION │ │ COMBINATION │
  • │ P(n, r) = n!/(n-r)! │ │ C(n, r) = n!/[r!(n-r)!│
  • └───────────────────────┘ └───────────────────────┘
  • President / VP / Sec • Advisory Committee
  • 1st, 2nd, 3rd Place • Group of 4 Chaperones
  • Seating order in a row • Pizza topping choices
  • Permutations (Order Matters)

A permutation is an ordered arrangement of r r r objects selected from a set of n n n distinct objects without replacement: P ( n , r ) = n ! ( n − r ) ! = n × ( n − 1 ) × ⋯ × ( n − r + 1 ) P(n, r) = \frac{n!}{(n - r)!} = n \times (n - 1) \times \dots \times (n - r + 1) P ( n , r ) = ( n − r )! n ! ​ = n × ( n − 1 ) × ⋯ × ( n − r + 1 )

Use permutations when roles are distinct, titles are assigned, or ranks are awarded (e.g., electing a President, Vice President, and Secretary).

Combinations (Order Does NOT Matter)

A combination is a selection of r r r objects chosen from a set of n n n distinct objects without regard to order: C ( n , r ) = ( n r ) = n ! r ! ( n − r ) ! = P ( n , r ) r ! C(n, r) = \binom{n}{r} = \frac{n!}{r!(n - r)!} = \frac{P(n, r)}{r!} C ( n , r ) = ( r n ​ ) = r ! ( n − r )! n ! ​ = r ! P ( n , r ) ​

Because order does not matter, selecting Person A, Person B, and Person C is identical to selecting C, B, and A. Dividing by r ! r! r ! eliminates redundant rearrangements of the same group.

Comparative Worked Example

A department has 10 eligible faculty members:

Scenario A (Permutation) : How many ways can the department elect a Chairperson, Vice Chair, and Recording Secretary?

Positional titles mean order matters: P ( 10 , 3 ) = 10 ! ( 10 − 3 ) ! = 10 ! 7 ! = 10 × 9 × 8 = 720 P(10, 3) = \frac{10!}{(10 - 3)!} = \frac{10!}{7!} = 10 \times 9 \times 8 = 720 P ( 10 , 3 ) = ( 10 − 3 )! 10 ! ​ = 7 ! 10 ! ​ = 10 × 9 × 8 = 720 ways.

Scenario B (Combination) : How many ways can the department select a 3-person peer-review committee?

All 3 members share equal status; order does not matter: C ( 10 , 3 ) = 10 ! 3 ! ⋅ 7 ! = 10 × 9 × 8 3 × 2 × 1 = 720 6 = 120 C(10, 3) = \frac{10!}{3! \cdot 7!} = \frac{10 \times 9 \times 8}{3 \times 2 \times 1} = \frac{720}{6} = 120 C ( 10 , 3 ) = 3 ! ⋅ 7 ! 10 ! ​ = 3 × 2 × 1 10 × 9 × 8 ​ = 6 720 ​ = 120 ways.

Foundational Probability Principles

Probability measures the mathematical likelihood that an event ( E E E ) will occur, bounded strictly on the interval from 0 0 0 to 1 1 1 : 0 ≤ P ( E ) ≤ 1 0 \le P(E) \le 1 0 ≤ P ( E ) ≤ 1

P ( E ) = 0 P(E) = 0 P ( E ) = 0 : An impossible event (e.g., rolling a 7 on a standard 6-sided die).

P ( E ) = 1 P(E) = 1 P ( E ) = 1 : A certain event (e.g., drawing a numbered card between 1 and 10 from a box of cards 1–10).

Theoretical vs. Experimental Probability

Theoretical Probability : Calculated by analyzing physical symmetry and equiprobable sample space outcomes without conducting empirical trials: P ( E ) = n ( E ) n ( S ) = Number of Favorable Outcomes Total Number of Equally Likely Outcomes P(E) = \frac{n(E)}{n(S)} = \frac{\text{Number of Favorable Outcomes}}{\text{Total Number of Equally Likely Outcomes}} P ( E ) = n ( S ) n ( E ) ​ = Total Number of Equally Likely Outcomes Number of Favorable Outcomes ​

Experimental (Empirical) Probability : Calculated from actual observed trials in an experiment: P ( E ) = Frequency of Event Occurrence Total Number of Observed Trials P(E) = \frac{\text{Frequency of Event Occurrence}}{\text{Total Number of Observed Trials}} P ( E ) = Total Number of Observed Trials Frequency of Event Occurrence ​

Law of Large Numbers : As the number of repetitions in an experiment increases, the empirical probability converges toward the theoretical probability.

The Complement Rule

The complement of an event E E E (denoted E c E^c E c or not E \text{not } E not E ) represents all outcomes in the sample space that are not in E E E . The sum of an event and its complement is always strictly 1: P ( E ) + P ( E c ) = 1 ⟹ P ( E c ) = 1 − P ( E ) P(E) + P(E^c) = 1 \implies P(E^c) = 1 - P(E) P ( E ) + P ( E c ) = 1 ⟹ P ( E c ) = 1 − P ( E )

Exam Shortcut ("At Least One") : To find the probability of obtaining "at least one success" across multiple trials, subtract the probability of zero successes from 1: P ( at least one ) = 1 − P ( none ) P(\text{at least one}) = 1 - P(\text{none}) P ( at least one ) = 1 − P ( none )

Compound Probability: Independent vs. Dependent Events

A compound event involves the joint occurrence of two or more simple events.

1. The Multiplication Rule (Joint "AND" Probability)

Independent Events : Two events A A A and B B B are independent if the occurrence of A A A has no influence on the probability of B B B . Sampling with replacement produces independent events: P ( A and B ) = P ( A ) × P ( B ) P(A \text{ and } B) = P(A) \times P(B) P ( A and B ) = P ( A ) × P ( B )

Dependent Events : Two events are dependent if the occurrence of A A A alters the sample space and probability of B B B . Sampling without replacement produces dependent events: P ( A and B ) = P ( A ) × P ( B ∣ A ) P(A \text{ and } B) = P(A) \times P(B \mid A) P ( A and B ) = P ( A ) × P ( B ∣ A ) where P ( B ∣ A ) P(B \mid A) P ( B ∣ A ) represents the conditional probability of B B B given that A A A has already occurred.

Worked Example: Sampling Without Replacement

A container holds 8 8 8 blue pens, 6 6 6 black pens, and 6 6 6 red pens (total = 20 = 20 = 20 pens). An instructor draws two pens at random consecutively without replacement. What is the probability that both pens drawn are blue?

First Draw : P ( Blue 1 ) = 8 20 = 2 5 P(\text{Blue}_1) = \frac{8}{20} = \frac{2}{5} P ( Blue 1 ​ ) = 20 8 ​ = 5 2 ​ .

Second Draw : Having removed one blue pen, 7 7 7 blue pens remain out of 19 19 19 total pens: P ( Blue 2 ∣ Blue 1 ) = 7 19 P(\text{Blue}_2 \mid \text{Blue}_1) = \frac{7}{19} P ( Blue 2 ​ ∣ Blue 1 ​ ) = 19 7 ​ .

Joint Probability : P ( Both Blue ) = 8 20 × 7 19 = 2 5 × 7 19 = 14 95 ≈ 0.1474 P(\text{Both Blue}) = \frac{8}{20} \times \frac{7}{19} = \frac{2}{5} \times \frac{7}{19} = \frac{14}{95} \approx 0.1474 P ( Both Blue ) = 20 8 ​ × 19 7 ​ = 5 2 ​ × 19 7 ​ = 95 14 ​ ≈ 0.1474

  • Compound Probability: Mutually Exclusive vs. Overlapping Events
  • 2. The Addition Rule (Disjunctive "OR" Probability)

Mutually Exclusive (Disjoint) Events : Events that cannot occur simultaneously ( P ( A and B ) = 0 P(A \text{ and } B) = 0 P ( A and B ) = 0 ): P ( A or B ) = P ( A ) + P ( B ) P(A \text{ or } B) = P(A) + P(B) P ( A or B ) = P ( A ) + P ( B ) Example : In a single roll of a fair die, rolling an odd number and rolling a 4 are mutually exclusive: 3 6 + 1 6 = 4 6 = 2 3 \frac{3}{6} + \frac{1}{6} = \frac{4}{6} = \frac{2}{3} 6 3 ​ + 6 1 ​ = 6 4 ​ = 3 2 ​ .

Non-Mutually Exclusive (Overlapping) Events : Events that share common outcomes ( A ∩ B ≠ ∅ A \cap B \neq \emptyset A ∩ B  = ∅ ). Adding their individual probabilities counts the intersection twice; therefore, the joint intersection must be subtracted: P ( A or B ) = P ( A ) + P ( B ) − P ( A and B ) P(A \text{ or } B) = P(A) + P(B) - P(A \text{ and } B) P ( A or B ) = P ( A ) + P ( B ) − P ( A and B )

Worked Example: Overlapping Probability in a Standard Deck

What is the probability of drawing either a King or a Diamond from a standard 52-card deck?

Total cards = 52 = 52 = 52 .

Kings: P ( King ) = 4 52 P(\text{King}) = \frac{4}{52} P ( King ) = 52 4 ​ .

Diamonds: P ( Diamond ) = 13 52 P(\text{Diamond}) = \frac{13}{52} P ( Diamond ) = 52 13 ​ .

Overlap: Exactly one card is both a King and a Diamond (the King of Diamonds): P ( King and Diamond ) = 1 52 P(\text{King and Diamond}) = \frac{1}{52} P ( King and Diamond ) = 52 1 ​ .

Applying the Addition Rule : P ( King or Diamond ) = 4 52 + 13 52 − 1 52 = 16 52 = 4 13 ≈ 0.3077 P(\text{King or Diamond}) = \frac{4}{52} + \frac{13}{52} - \frac{1}{52} = \frac{16}{52} = \frac{4}{13} \approx 0.3077 P ( King or Diamond ) = 52 4 ​ + 52 13 ​ − 52 1 ​ = 52 16 ​ = 13 4 ​ ≈ 0.3077

Visualizing Sample Spaces: Tree Diagrams and Grids

Tree Diagrams : A branched graph representing multi-stage probability. Each branch represents an outcome weighted by its transition probability; multiplying probabilities along a continuous path from root to leaf yields the joint probability of that specific sequence.

Coordinate Grids (Sample Space Grids) : Ideal for two-stage experiments such as rolling two dice. A 6 × 6 6 \times 6 6 × 6 grid displays all 36 36 36 equiprobable ordered pairs ( d 1 , d 2 ) (d_1, d_2) ( d 1 ​ , d 2 ​ ) , making sums (such as rolling a sum of 7: ( 1 , 6 ) , ( 2 , 5 ) , ( 3 , 4 ) , ( 4 , 3 ) , ( 5 , 2 ) , ( 6 , 1 ) ⟹ 6 36 = 1 6 (1,6), (2,5), (3,4), (4,3), (5,2), (6,1) \implies \frac{6}{36} = \frac{1}{6} ( 1 , 6 ) , ( 2 , 5 ) , ( 3 , 4 ) , ( 4 , 3 ) , ( 5 , 2 ) , ( 6 , 1 ) ⟹ 36 6 ​ = 6 1 ​ ) easy to identify.

Loading diagram... Probability Rules and Event Types Flowchart