IB DP Mathematics: Applications and Interpretation (AI) — SL and HL
Distributions 1 · Discrete random variables & probability distributions
IB DP Mathematics: Applications and Interpretation (AI) — SL and HL
0% Completed
Start Here — How This Course Works
Read this first: how to use the five mock sets, exam rules for AI SL (both papers use the GDC), how to self-mark with the IB-style keys, and your 10-day revision plan.
The GDC is allowed in BOTH AI SL papers — fluency is marks. Press-to-Test exam mode, and the core TI-Nspire CX II skills used throughout the marking keys: nSolve, graphing and intersections, regression, financial solver (TVM), statistics and distribution menus.
Full step-by-step notes with Prof. Kitso for AI 1.1, 1.6: every idea explained simply, worked examples with TI-Nspire CX II screens, exam-style challenge questions and try-it-yourself activities. SL and HL students.
Full step-by-step notes with Prof. Kitso for AI 1.5: every idea explained simply, worked examples with TI-Nspire CX II screens, exam-style challenge questions and try-it-yourself activities. SL and HL students.
Learn 1 · Arithmetic & geometric sequences and series (AI 1.2, 1.3) — SL & HL
Full step-by-step notes with Prof. Kitso for AI 1.2, 1.3: every idea explained simply, worked examples with TI-Nspire CX II screens, exam-style challenge questions and try-it-yourself activities. SL and HL students.
Full step-by-step notes with Prof. Kitso for AI 1.4, 1.7: every idea explained simply, worked examples with TI-Nspire CX II screens, exam-style challenge questions and try-it-yourself activities. SL and HL students.
Full step-by-step notes with Prof. Kitso for AI 1.8: every idea explained simply, worked examples with TI-Nspire CX II screens, exam-style challenge questions and try-it-yourself activities. SL and HL students.
HL · Learn 1 · Laws of logarithms, rational exponents, infinite series & log scales (AI 1.9–1.11, 2.10) — HL
Full step-by-step notes with Prof. Kitso for AI 1.9–1.11, 2.10: every idea explained simply, worked examples with TI-Nspire CX II screens, exam-style challenge questions and try-it-yourself activities. HL only.
Full step-by-step notes with Prof. Kitso for AI 1.12, 1.13: every idea explained simply, worked examples with TI-Nspire CX II screens, exam-style challenge questions and try-it-yourself activities. HL only.
Full step-by-step notes with Prof. Kitso for AI 1.14, 1.15: every idea explained simply, worked examples with TI-Nspire CX II screens, exam-style challenge questions and try-it-yourself activities. HL only.
Full step-by-step notes with Prof. Kitso for AI 2.1–2.4: every idea explained simply, worked examples with TI-Nspire CX II screens, exam-style challenge questions and try-it-yourself activities. SL and HL students.
Full step-by-step notes with Prof. Kitso for AI 2.5, 2.6: every idea explained simply, worked examples with TI-Nspire CX II screens, exam-style challenge questions and try-it-yourself activities. SL and HL students.
Full step-by-step notes with Prof. Kitso for AI 2.7–2.9: every idea explained simply, worked examples with TI-Nspire CX II screens, exam-style challenge questions and try-it-yourself activities. HL only.
Full step-by-step notes with Prof. Kitso for AI 3.1–3.3: every idea explained simply, worked examples with TI-Nspire CX II screens, exam-style challenge questions and try-it-yourself activities. SL and HL students.
Full step-by-step notes with Prof. Kitso for AI 3.4–3.6: every idea explained simply, worked examples with TI-Nspire CX II screens, exam-style challenge questions and try-it-yourself activities. SL and HL students.
Full step-by-step notes with Prof. Kitso for AI 3.7–3.9: every idea explained simply, worked examples with TI-Nspire CX II screens, exam-style challenge questions and try-it-yourself activities. HL only.
Full step-by-step notes with Prof. Kitso for AI 3.10–3.13: every idea explained simply, worked examples with TI-Nspire CX II screens, exam-style challenge questions and try-it-yourself activities. HL only.
Full step-by-step notes with Prof. Kitso for AI 3.14–3.16: every idea explained simply, worked examples with TI-Nspire CX II screens, exam-style challenge questions and try-it-yourself activities. HL only.
Step-by-step teaching notes from the very beginning: every idea explained simply, worked examples with TI-Nspire CX II screens, exam-style challenge questions and try-it-yourself activities. SL 4.1–4.4 (HL students study these too).
Full step-by-step notes with Prof. Kitso for AI 4.5, 4.6: every idea explained simply, worked examples with TI-Nspire CX II screens, exam-style challenge questions and try-it-yourself activities. SL and HL students.
Learn 4 · Probability distributions: discrete, binomial & normal (AI 4.7–4.9) — SL & HL
Full step-by-step notes with Prof. Kitso for AI 4.7–4.9: every idea explained simply, worked examples with TI-Nspire CX II screens, exam-style challenge questions and try-it-yourself activities. SL and HL students.
Full step-by-step notes with Prof. Kitso for AI 4.10, 4.11: every idea explained simply, worked examples with TI-Nspire CX II screens, exam-style challenge questions and try-it-yourself activities. SL and HL students.
Full step-by-step notes with Prof. Kitso for AI 4.14, 4.15, 4.17, 4.19: every idea explained simply, worked examples with TI-Nspire CX II screens, exam-style challenge questions and try-it-yourself activities. HL only.
Full step-by-step notes with Prof. Kitso for AI 4.12, 4.13, 4.16, 4.18: every idea explained simply, worked examples with TI-Nspire CX II screens, exam-style challenge questions and try-it-yourself activities. HL only.
Full step-by-step notes with Prof. Kitso for AI 5.1–5.4: every idea explained simply, worked examples with TI-Nspire CX II screens, exam-style challenge questions and try-it-yourself activities. SL and HL students.
Full step-by-step notes with Prof. Kitso for AI 5.6, 5.7: every idea explained simply, worked examples with TI-Nspire CX II screens, exam-style challenge questions and try-it-yourself activities. SL and HL students.
Learn 5 · Integration, area & the trapezoidal rule (AI 5.5, 5.8) — SL & HL
Full step-by-step notes with Prof. Kitso for AI 5.5, 5.8: every idea explained simply, worked examples with TI-Nspire CX II screens, exam-style challenge questions and try-it-yourself activities. SL and HL students.
Full step-by-step notes with Prof. Kitso for AI 5.9, 5.10: every idea explained simply, worked examples with TI-Nspire CX II screens, exam-style challenge questions and try-it-yourself activities. HL only.
Full step-by-step notes with Prof. Kitso for AI 5.11–5.13: every idea explained simply, worked examples with TI-Nspire CX II screens, exam-style challenge questions and try-it-yourself activities. HL only.
Full step-by-step notes with Prof. Kitso for AI 5.14–5.18: every idea explained simply, worked examples with TI-Nspire CX II screens, exam-style challenge questions and try-it-yourself activities. HL only.
Full mock: Paper 1 (short questions, 80 marks, 90 min) and Paper 2 (extended questions, 80 marks, 90 min), both with the GDC, each with a full IB-style marking key. Paper 1 and its key are FREE to preview. Sit the paper under timed conditions before opening the key.
Second full mock (Paper 1 + Paper 2 with marking keys) covering a fresh rotation of the AI SL syllabus. Re-drill anything you dropped marks on in Set 1 before you sit it.
Third full mock (Paper 1 + Paper 2 with marking keys). By the end of this set you should have met every AI SL topic at least once — use your score log to find remaining weak areas.
Fourth full mock (Paper 1 + Paper 2 with marking keys). Sit both papers back-to-back with only a short break — train the stamina the real exam session demands.
Final full mock (Paper 1 + Paper 2 with marking keys). Treat this as your dress rehearsal: full exam conditions, formula booklet only, and strict timing.
What to do (and not do) in the last two days before each exam: a 48-hour checklist, formula booklet final pass, GDC battery-and-settings check, and the exam-day routine.
Module 28 of 47Lesson 1 of 8· Distributions 1 · Discrete random variables & probability distributions
1
Probability distributions: discrete, binomial & normal · Essential understanding 1
Discrete random variables & probability distributions
IB AI SL 4.7with Prof. Kitso
💻 Using the TI-Nspire CX Student Software on a laptop
The screens in these notes are drawn exactly as the Student Software shows them. The keypad on the left of the software works like the handheld — click its keys with the mouse.
menu: click menu on the on-screen keypad (or Documents Toolbox ▸ 🔧). The menu numbers and letters are the same as in these notes.
enter = Enter · tab = Tab (next box) · esc = Esc · del = Backspace.
Powers: type ^ (Shift+6), the power, then press → to come back down before typing more. x² = ^2 then →.
Fraction: type / · √: type sqrt( · π: type pi · eˣ: type exp( · store: type :=. For EE (×10ⁿ) and i, click them on the keypad.
Radian / Degree: click Settings in the status bar at the bottom of the window. The mode (RAD or DEG) shows in the top bar.
IB exam mode (Press-to-Test): everything in these notes works on the non-CAS TI-Nspire with the IB exam settings. In exam mode there are no dot-product, cross-product, unit-vector or eigenvalue keys and no Diff Eq graphs — the notes show the allowed way (type the components, use polyRoots on the characteristic equation, do Euler steps on a Calculator page).
If you type nDeriv(, the software shows it as centralDiff( — it is the same command.
The big idea: A discrete random variable is a number that depends on chance and can only take separate values (0, 1, 2, …). Its probability distribution is a list of every possible value with its probability, and the probabilities always add up to 1.
By the end of this lesson you can:
explain what a discrete random variable is and write it as X
write a probability distribution as a table
use to find a missing probability or an unknown such as k
find probabilities such as P(X ≥ 2) and P(X < 3) by adding rows of the table
find a conditional probability from a table
build a distribution from a coin, a dice or a draw without replacement
🧑🏾 Imagine this…
Kabo tosses a fair coin 3 times and counts the heads. Before he starts, he does not know the answer. It could be 0, 1, 2 or 3, and it depends on chance. We give this unknown number a name, X. The question changes from “what will happen?” to “how likely is each possible value of X?” Writing those chances in a table is called finding the probability distribution of X.
Random variable
a quantity whose value depends on chance. We name it with a capital letter, such as X or Y.
Discrete random variable
a random variable that takes only separate values you can list or count, such as the number of heads, the number of goals or the score on a dice.
read “the probability that X is equal to x”. Capital X is the variable. Small x is one particular value, for example .
Probability distribution
all the possible values of X together with their probabilities, usually shown in a two-row table.
★ Two rules every probability distribution obeys
Every probability is between 0 and 1: .
All the probabilities add up to exactly 1: (learn this one, you need it all the time).
To find P(X ≥ 2), add the probabilities of every value that is 2 or more. To find P(X < 3), add the values that are less than 3 (2, 1, 0, …).
Conditional probability (given that something has already happened): . Shrink the table to the values allowed by B, then divide by their total.
x
0
1
2
3
P(X = x)
0.125
0.375
0.375
0.125
That is the distribution for the number of heads in 3 tosses of a fair coin (Example 1.1 shows where the numbers come from). Check the rules: every entry is between 0 and 1, and 0.125 + 0.375 + 0.375 + 0.125 = 1.
⚠️ Watch out
The probabilities must add to exactly 1. If your table adds to 0.9 or 1.1, something is missing or wrong. If an unknown k comes out negative, or bigger than 1, re-check your adding.
Strict or not? P(X < 3) does not include 3, but P(X ≤ 3) does. When X can only be a whole number, P(X < 3) = P(X ≤ 2). Always ask yourself “is the end value included?”
Do not mix up x (the values in the top row) with P(X = x) (the probabilities in the bottom row). You add probabilities, never the x values, when you are finding a probability.
💡 Command terms
Write down the probability distribution = give the table of x and P(X = x). Show that a table is valid = add the probabilities and show the total is 1. Find k = form an equation from ΣP = 1 and solve it. In every case, give probabilities as fractions or to 3 significant figures.
🧪 Try it yourselfSee a distribution as bars
The bars show the distribution of the number of heads in 3 tosses (n = 3, p = 0.5). Tap the “from” and “to” boxes: the red bars are added together. Set from 0 to 3 and the total is 1. Set from 2 to 3 to see P(X ≥ 2). You will learn the name “binomial” in Lesson 3.
Worked examples
Example 1.1Building a distribution from outcomes
Kabo tosses a fair coin 3 times. Let X be the number of heads. (a) Write down the probability distribution of X. (b) Find P(X ≥ 2).
🧠 Think it through
List all 8 equally likely outcomes: HHH, HHT, HTH, THH, HTT, THT, TTH, TTT.
Count the heads in each outcome. Three heads: 1 way. Two heads: 3 ways. One head: 3 ways. No heads: 1 way.
Each probability is .
Check that the four probabilities add to 1.
✍️ By hand
🔢 On your TI-Nspire CX II
Check the total with sum( ) on a Calculator page. Type the four probabilities as a list in curly brackets, ctrl💻 Ctrl( .
In 2k, the 2 and k are multiplied. On the GDC type 2k or 2*k; both work.
Example 1.4A distribution given by a rule
A prize machine at a school fair gives a prize level X ∈ {1, 2, 3, 4, 5}, where . (a) Show that . (b) Write down the probability distribution. (c) Find P(X ≥ 4).
🧠 Think it through
Put x = 1, 2, 3, 4, 5 into k(6 − x) to see the five probabilities in terms of k: 5k, 4k, 3k, 2k, k.
They add to 1, so 15k = 1.
Substitute k = into each row and simplify.
✍️ By hand
(c)
🔢 On your TI-Nspire CX II
Use seq( to build the five terms, then solve for k.
✅ Answer (a) 15k = 1, so k = . (b) x = 1, 2, 3, 4, 5 with P = , , , , . (c) .
“Show that k = ” means you must write the equation 15k = 1 yourself. Stating k = from the GDC alone does not earn the marks.
Example 1.5A draw without replacement
A box holds 9 phones, of which 3 are faulty. Kabo takes 2 phones at random, one after the other, without putting any back. Let X be the number of faulty phones he takes.
(a) Draw up the probability distribution of X.
(b) Find P(X ≥ 1).
🧠 Think it through
Without replacement, the second probability changes: after one phone is gone there are only 8 left.
X = 0 means both are good: 6 good out of 9, then 5 good out of 8.
X = 2 means both are faulty: 3 out of 9, then 2 out of 8.
X = 1 is the rest. You can find it by subtraction, because the three probabilities must add to 1.
✍️ By hand
(b)
🔢 On your TI-Nspire CX II
Type the products as decimals (press ctrl💻 Ctrlenter ↵💻 Enter to get a decimal).
⭐ Challenge 1.7Larger score on two dicePaper 2 style
Two fair four-sided dice, each numbered 1 to 4, are rolled together. Let X be the larger of the two scores (if both scores are the same, X is that score).
(a) List the 16 possible outcomes, or draw a table, and find the probability distribution of X.
(b) Show that your probabilities add to 1.
(c) Find P(X ≥ 3).
(d) Find P(X = 4 | X ≥ 3).
(e) Kabo says: “X = 4 is the most likely value, so it happens more than half the time.” Is he right? Use your table to answer.
✏️ Try it on paper and on your calculator first. Then check.
Show the full solution
🧠 Think it through
Draw a 4 × 4 grid of the 16 pairs (first dice, second dice). Fill each cell with the larger number.
Count how many cells contain a 1, a 2, a 3 and a 4. Divide each count by 16.
X ≥ 3 means X is 3 or 4.
Conditional: P(X = 4) divided by P(X ≥ 3).
For the last part, compare P(X = 4) with 0.5.
✍️ By hand
: only (1,1), so 1 outcome. : (1,2), (2,1), (2,2), so 3 outcomes.
: 5 outcomes. : 7 outcomes.
(a) for x = 1, 2, 3, 4.
(b)
(c)
(d)
(e)
🔢 On your TI-Nspire CX II
Check the arithmetic.
✅ Answer (a) x = 1, 2, 3, 4 with P = , , , . (c) . (d) = 0.583. (e) No: X = 4 is the most likely single value, but its probability is only = 0.4375, which is less than one half.
“Most likely value” (the mode of the distribution) does not mean “likely more often than not”. A value can have the biggest probability and still be less than 0.5.