Study with the several resources on Docsity
Earn points by helping other students or get them with a premium plan
Prepare for your exams
Study with the several resources on Docsity
Earn points to download
Earn points by helping other students or get them with a premium plan
IB Mathematics | Complete Reference Guide Complete Combinatorics Summary Sheet
Typology: Cheat Sheet
1 / 17
This page cannot be seen from the preview
Don't miss anything!
Table of Contents & Structural Blueprint
This textbook reference is structured dynamically across sequential pages to guarantee full conceptual mastery of all core counting and probability syllabi objectives outlined in the visual document:
Page Academic Module & Focus Area Core Pedagogical Learning Objectives
Chapter 12: Conditional Probability Frameworks
Evaluating structural spaces given previous systemic certainties.
Chapter 13: Systematic Pitfalls, Exam Strategies & GDC Utilization
Avoiding conceptual errors and maximizing marks on Papers 1, 2, and 3.
Chapter 1: The Core Architecture of Combinatorics
Combinatorics is the branch of pure mathematics concerned with the study of finite or countable discrete structures. At its core, it focuses on the enumeration, arrangement, and configuration of objects within sets to satisfy specified criteria without explicitly listing out every individual outcome.
As structurally mapped out in the foundational syllabus guide, combinatorics operates via three main activities:
Counting Possibilities: Determining the absolute numeric volume of possible outcomes resulting from complex, multi-layered systemic operations. Arranging Objects: Assigning items to specific positions in linear or circular arrays, where individual spatial identity impacts the validity of the structure. Selecting Groups: Sucking an isolated sample pool out from a larger population database to formulate unranked committees, sets, or functional groups.
The Fundamental Curricular Rule of Choice
To determine the appropriate mathematical tool for any counting problem, you must ask one golden question: Does the sequence of choice matter?
If changing the placement order changes the overall identity of the outcome (e.g., passwords, security codes, podiums), the problem belongs to Permutations.
If switching the choice sequence preserves the net identity of the outcome (e.g., a card hand, choosing teammates, mixing ingredients), the problem belongs to Combinations.
Chapter 3: Permutations under Absolute Order Profiles
Permutations define the total number of ways to uniquely organize a specific subset of elements extracted from a larger master set, under the condition that order matters completely.
When selecting a subset of r distinct objects from a primary pool of n available items, the absolute number of unique arrangements is evaluated as:
Subject to the strict boundary domain: n ≥ r ≥ 0.
Sequential Placement Profiles: Assigning positions on a podium (Gold, Silver, Bronze) where being first vs. third represents a different permutation outcome. Role-Specific Allocations: Selecting executive officers (President, VP, Secretary) out of an organizational cohort. Alphanumeric Codes: Creating structural strings or pin codes where "1-2-3" is independent of "3-2-1".
Worked Examination Example
Find the total number of unique ways to award the 1st, 2nd, and 3rd place trophies among a competitive running field of 5 elite sprinters:
Thus, exactly 60 distinct podium configurations can be realized.
Chapter 4: Combinations & Unordered Set Selections
Combinations assess the volume of unique ways to select a subset of items from a total group where the sequence of selection is completely irrelevant. In this model, the set containing elements {X, Y} is treated as identical to the set containing {Y, X}.
The total number of ways to choose an unordered group of r elements from an overall universe of n distinct items is defined as:
Committee Formations: Choosing a delegation of 3 students out of 5 to attend an international forum without administrative roles. Simultaneous Extractions: Sucking 4 colored marbles at random out of an opaque container simultaneously. Geometric Determinations: Selecting sets of points to establish vertices for polygons (e.g., combinations of 3 points needed to define triangles).
Worked Examination Example
Calculate the total number of unique non-ranked committees that can be formed by choosing 3 students out of a group of 5 nominees:
Consequently, only 10 unique committee variations can be established.
Chapter 6: Arrangements with Strict Structural Constraints
Standard permutation and combination metrics assume clean environments. Real-world exam problems introduce specific constraints that alter the available sample space.
If an element can be selected repeatedly across multiple sequential slots (e.g., alphanumeric pin codes, combination padlocks), the number of choices remains constant at n for each of the r available slots. Applying the multiplication principle yields:
When questions require specific items to sit together, treat those grouped items as one single consolidated macro- element. First, calculate the total arrangements of the overall system including this new block element. Second, multiply that result by the internal permutations of the elements within the block itself.
Strategic Tool: The Complementary Approach for Separation
If a constraint requires that two elements must never be placed next to each other, it is often far easier to calculate the total unrestricted arrangements and subtract the arrangements where they are together:
Chapter 7: Permutations over Indistinguishable Objects
When arranging a set of items where some elements are identical, shifting those identical items with each other does not produce a visibly distinct new sequence.
If a total pool of n objects contains duplicate groups where the first type repeats a times, the second type repeats b times, and the third repeats c times, the absolute number of unique linear arrangements is given by dividing the total factorial by the product of the duplicate factorials:
Classical Exemplar: Shuffling the String "BOOK"
The target word contains 4 total character slots ( n = 4 ). The vowel "O" is duplicated exactly twice ( a = 2 ), while "B" and "K" appear once.
Applying the multiset formula:
Without the identical character constraint, the permutations would equal 24. The duplicate elements reduce the unique linear output space by exactly half.
Chapter 9: Axiomatic Probability Foundations
Probability theory uses combinatorial counting to calculate the numerical likelihood that a specific event will occur within a defined sample space.
The probability of an event A occurring, denoted as P(A) , is the ratio of the number of successful outcomes to the total number of possible outcomes within that experiment's sample space:
The Probability Bounds: The probability of any given event must always fall within a closed range from 0 to 1:
where 0 indicates an impossible event and 1 indicates absolute certainty. Summation Rule: The sum of all individual probabilities across an entire sample space always equals 1.
The complement of event A (denoted as A' or Ac ) represents the event that A does not occur. Its probability is calculated using the subtraction rule:
Chapter 10: Compound Events: Independence & Mutual Exclusivity
When analyzing multiple events simultaneously, the operations of intersection (AND) and union (OR) depend heavily on how those events interact with each other.
Two events A and B are independent if the occurrence of one has absolutely no effect on the probability of the other (e.g., rolling a die and flipping a coin). Their intersection probability is computed using the multiplication rule:
Events are mutually exclusive if they cannot happen at the same time (e.g., rolling a 2 and a 5 on a single die). Their intersection is an impossible event:
Consequently, the probability of either event occurring (their union) is simply the sum of their individual probabilities:
If two events are not mutually exclusive and share an intersection, you must subtract that overlapping region to prevent double-counting when calculating their union:
Chapter 12: Conditional Probability Frameworks
Conditional probability evaluates the likelihood of an event occurring, given the certainty that another prior event has already taken place. This prior event effectively shrinks the relevant sample space.
The conditional probability of event A occurring given that event B has already occurred is denoted as P(A | B) and is defined by the formula:
This formula is strictly valid under the condition that P(B) ≠ 0.
You can identify conditional probability problems by looking for key phrasing within the question text, such as:
"Given that..." or "On the condition that..." "Knowing that a randomly selected student is male, find the probability that..." "If a randomly selected component is found to be defective, what is the probability it came from Factory X?"
In all these scenarios, your calculations must shift focus away from the entire sample space and look only at the subset defined by condition B.
Chapter 13: Systematic Pitfalls, Exam Strategies & GDC Utilization
Common Curricular Errors to Avoid
Misidentifying Order Dependency: Rushing into a solution using permutations when the problem context requires combinations, or vice versa. Neglecting Factorial Simplifications: Leaving large factorial fractions unsimplified on Paper 1, which leads to arithmetic errors and lost marks. Confusing Independence with Mutual Exclusivity: Treating mutually exclusive events as independent, even though mutually exclusive events are highly dependent (if one happens, the other cannot).
Analyze the Constraints First: Before doing any calculations, ask yourself: Is repetition allowed? Does the arrangement order matter? State Your Formulas Explicitly: Always write down the general formula you are using before plugging in numbers. This ensures you earn method marks, even if you make a calculation error later. Optimize Your GDC: On technology-allowed exams (Papers 2 and 3), save time and prevent arithmetic mistakes by using your calculator's built-in nPr and nCr functions rather than expanding factorials by hand.
