Discrete random variables — the probability function and the discrete uniform distribution
~50 min · WST01 · 5.2
WST01 · 5.2 · 50 min
A probability function isn't finished the moment every value looks reasonable on its own — it's finished when the whole list adds up to exactly 1. A real WST01 examiner report names the single most common way this goes wrong, and it isn't a miscalculation: it's forgetting that a value — often specifically — belongs in the domain at all. This lesson builds the probability function and the cumulative distribution function from the one fact that makes that self-check work (, because is certain to take *some* value), then uses a genuinely rich real exam question — two four-sided dice, from the most recent series reviewed for this course — to show a discrete uniform distribution, a probability, a mean found "by symmetry," and a variance that has to be summed by hand all compose inside one real question.
Before you read on
Two or three questions on exactly what this lesson teaches. Being wrong here is fine — it's the fastest way to find out what to pay attention to next.
What a discrete random variable actually is
In plain terms
Imagine tossing a fair coin twice and counting the number of heads. Before you toss it, you don't know what the count will be — but you know it has to be one of exactly three possibilities: 0, 1 or 2 heads, and you can work out how likely each one is (a quarter, a half, a quarter). That whole package — the list of everything that could happen, plus how likely each one is — is what a discrete random variable IS. Nothing more mysterious than that: a quantity that depends on chance, and can only land on one of a countable list of separate values, never on a value in between.
The word "discrete" is doing real work: it means can only take a finite (or countably infinite) list of SEPARATE values — 0, 1 or 2 heads, never 1.5 heads — which is exactly why it makes sense to attach one specific probability to each individual value. (A continuous quantity, like a height or a time, can't be handled this way: there are infinitely many possible values in any range, so no single value gets its own nonzero probability — a different unit of this course entirely, the Normal distribution.) Notation matters here: capital names the random variable itself — the process, before you know its outcome — and lowercase names one specific value it might take. Writing keeps that distinction visible: "the probability that the random process lands on the particular value ."
Formally
Spec 5.1 states this bookwork content plainly: "the concept of a discrete random variable." Formally, is a variable defined on the outcomes of a random experiment, taking values in a finite or countably infinite set of real numbers, and every value in that set has an associated probability — the probability function, examined properly in the next block. This spec item doesn't get its own line in the reviewed exam record: the facts bank's own per-topic breakdown for Section 5 moves straight from this concept to the probability function (5.2) without citing any standalone "define a discrete random variable" question (WST01-verified-facts.md §5) — consistent with 5.1 functioning as the foundation every other Section 5 spec point — the probability function, mean and variance, the discrete uniform distribution — is built directly on top of, which is exactly why it's worth stating precisely here rather than treating it as too obvious to write down.
The probability function, and the one formula that isn't on the sheet
A discrete random variable's probability function, , assigns a probability to every value can take. Spec 5.2's own guidance keeps this deliberately simple: "simple uses of p(x) = P(X = x)" (WST01-verified-facts.md §1) — the exam mostly tests whether you can read a probability function correctly and use it, not derive one from first principles. It's usually given to you as a table (values across the top, probabilities underneath) or as a formula in terms of for a handful of stated values, like — and either way, exactly two conditions have to hold for it to be a valid probability function: for every value in the domain, and summed across the WHOLE domain. The second of those is where nearly every genuinely documented error on this spec point lives, and the mechanism block right after this one derives exactly why it has to hold, rather than asking you to take it on faith.
The second piece of this spec item is the cumulative distribution function, for — a running total of probability up to and including a given value. This is worth getting right before an exam, not after: unlike the base , and formulae, which ARE printed in the Mathematical Formulae and Statistical Tables booklet (the discrete-random-variable side is covered in full in this course's E(aX+b)/Var(aX+b) lesson), the CDF's own definition is explicitly on the list of formulae "students are expected to know" and which "will not appear in the booklet" (WST01-verified-facts.md §1/§2a). Two details are easy to get backwards under exam pressure: the inequality is , not — includes the probability AT itself, not just everything strictly below it — and the sum always runs from the smallest value in the domain upward, never from the top down.
Mechanism
Why has to equal exactly 1 — not approximately, not usually
Every discrete random variable's probability function has to satisfy two conditions, and neither is optional: for every value (a probability can never be negative), and over the whole domain. Where does the second condition actually come from? Start from what IS: a variable whose value is the outcome of a random process, which means is certain to take SOME value from its domain — that's simply what "random variable" means, not an extra assumption layered on top. The events "", "", and so on for every value in the domain, are mutually exclusive ( cannot simultaneously equal two different values at once) and, together, exhaustive (there is no other outcome could have). For mutually exclusive events, probabilities add — the general addition rule (spec 3.2, this course's own conditional-probability lesson covers it in full) collapses to plain addition the moment — so . And the left-hand side of that equation is just : the probability of the certain event, which is by definition. That's the whole derivation. isn't a separate rule to memorise alongside — it falls straight out of what a random variable's domain actually IS: a list of outcomes that between them account for everything that could happen. Which is exactly why checking the sum is such a powerful self-check: if your working produces a total that isn't , either an arithmetic slip was made, or — the single most common version of this on the real exam — a genuinely possible value was left out of the domain before any arithmetic even started. A verified WST01 examiner report states this almost as a piece of exam advice in its own right: "had students checked whether the sum of their probabilities equalled 1 they may have realised that they had missed zero out" (Oct 2021, Q4(d)).
In your own words
In one sentence: why does the fact that must take SOME value force to equal exactly 1, rather than merely 'roughly' or 'approximately' 1?
The discrete uniform distribution — thin on this paper, but genuinely simple
A discrete random variable is Discrete Uniform when every value in its domain is equally likely — that's the entire definition. For possible values, each one gets probability , whatever those values actually are. It's worth being honest about how this spec point actually shows up on the real exam: the research pass behind this lesson found it thin as a STANDALONE topic — beyond one rich worked example (below), it tends to appear as the easy opening part of a larger discrete-random-variable question, naming the distribution for a couple of marks, rather than anchoring a multi-part question of its own (WST01-verified-facts.md §5, §7). That's stated here plainly rather than dressed up with more past-paper evidence than actually exists for it.
One detail worth being deliberate about: "discrete uniform" does not mean "the consecutive integers 1 to n." It means equally likely, full stop — the actual values can be spaced however the question defines them. A real, verified WST01 question (Jan 2025, Q1) uses exactly this: one die numbered 1, 2, 3, 4 (a Discrete Uniform distribution on consecutive integers) and a second numbered 1, 3, 5, 7 (a Discrete Uniform distribution on evenly-spaced ODD numbers). The mark scheme credits "Discrete uniform" as the correct name for the first one outright (B1, spec item 5.4), and identical reasoning applies to the second, non-consecutive one for exactly the same underlying reason: every one of its four values is equally likely.
Spec 5.4's own guidance is short: "the mean and variance of this distribution." For a symmetric, evenly-spaced discrete uniform distribution, the mean has a genuine shortcut — it sits exactly at the midpoint of the smallest and largest value, , without needing to sum every term individually — and this is precisely the shortcut a real WST01 question signals is available, asking for and explicitly "by symmetry" (Jan 2025, Q1(c)). Variance has no equivalent shortcut on this spec: no single formula is printed anywhere for the variance of an arbitrary discrete uniform distribution, so it has to be found the ordinary way, from using the base formulae that ARE in the booklet (§2a; the full derivation of what that formula means and where it comes from lives in this course's E(aX+b)/Var(aX+b) lesson) — which is exactly why the real question asks for it "showing your working" (Jan 2025, Q1(d)): there is no shortcut result to simply quote from memory here.
Worked, in full
Two four-sided dice, from the real thing — WST01 Jan 2025 Q1, as far as this research pass can honestly reconstruct it
- 01
Two four-sided dice are rolled: die is numbered 1, 2, 3, 4 and die is numbered 1, 3, 5, 7 (a real, verified WST01 setup — Jan 2025, Q1). Both dice are fair, so every face is equally likely: is Discrete Uniform on and is Discrete Uniform on , each independently of the other.
Earns: B1 — the real mark scheme credits naming the distribution of as "Discrete uniform" on its own, with no calculation attached (Jan 2025, Q1(a)).
- 02
.
Earns: Matches the real mark scheme's own answer for this part exactly (Jan 2025, Q1(b)).
- 03
Both distributions are symmetric — evenly spaced values with no skew toward either end — so each mean sits exactly at the midpoint of its lowest and highest value, without needing the full sum: , and . This is the "by symmetry" shortcut the real question explicitly signals is available (Jan 2025, Q1(c)).
Earns: VERIDIAN-computed. The research pass confirmed the real mark scheme asks for E(R) and E(B) 'by symmetry' but did not quote its exact figures for this part — 2.5 and 4 are the direct, forced arithmetic consequence of the verified R and B distributions, not an independent invention.
- 04
, so . The real question explicitly asks for this 'showing your working' — the symmetry shortcut that found the mean has no equivalent for variance: every term has to be summed.
Earns: VERIDIAN-computed, same caveat as stage 3: the real question's own numeric answer for Var(B) was not quoted in the research pass; 5 is the forced consequence of the verified B distribution.
- 05
and are independent (two separate dice), so all pairs are equally likely, each with probability . Listing for every pair and keeping only those : from , gives 2 and gives 4 (2 pairs); from , gives 3 and gives 5 (2 pairs); from , gives 4 (1 pair); from , gives 5 (1 pair). favourable pairs, so .
Earns: VERIDIAN-computed by full enumeration of the 16 equally likely outcome-pairs — the research pass confirmed this part was asked (Jan 2025, Q1(e)) but did not quote a numeric answer for it.
- 06
takes the values for . Comparing each against the four values of : for (), for 3 of the 4 values (3, 5, 7); for (), for 2 of them (5, 7); for and (), no value of (maximum 7) is bigger. favourable pairs out of 16, so .
Earns: VERIDIAN-computed, same method as stage 5. The real question's part (f) asks for exactly this probability (Jan 2025, Q1(f)); its own quoted numeric answer was not captured in the research pass.
Source — Mark scheme, Jan 2025
"Discrete uniform"
Complete it yourself
Complete the chain — a discrete uniform spinner, Discrete Uniform on
- 01
A fair spinner has five equally likely outcomes: 2, 4, 6, 8, 10. Let be the score shown. is Discrete Uniform on , so for each of the five values.
- 02
.
Marked, line by line
A discrete random variable has probability function for , and otherwise, where is a constant. (VERIDIAN-original question and distribution — not a reproduction of any past-paper question.) (a) Show that . (2) (b) Find . (2) (c) Find . (2)
6 marks available
(a) — 2 marks
“Show that” — the answer is already printed above
Matching the printed result isn’t the same as deriving it — real examiner reports describe scripts that adjust flawed working just to still land on it. Write your own full working below before checking it against the mark scheme.
(b) — 2 marks
- 101M1
Method mark for identifying the correct values in the domain (2 and 3) and adding their probabilities.
- 102A1
Accuracy mark. The fraction is already in lowest terms — 13 and 14 share no common factor — but the equivalent decimal, 0.929 to 3 s.f., would also be accepted under the verified WST01 'oe' mark-scheme convention (WST01-verified-facts.md §4).
(c) — 2 marks
- 201M1
Method mark for using the CDF's own definition, F(x₀) = P(X≤x₀) = Σp(x) for x≤x₀ — a formula that is explicitly NOT printed in the formula booklet (WST01-verified-facts.md §2a) and must be recalled, not looked up.
- 202A1
Accuracy mark, correct answer only.
Named traps
- possible-value-left-out-of-domain
- The headline trap of this whole spec point, in Pearson's own words: "the most common error was to miss out the value x = 0... had students checked whether the sum of their probabilities equalled 1 they may have realised that they had missed zero out" (Oct 2021, Q4(d)). The defence is the mechanism block above, not repetition: Σp(x) = 1 because X is certain to take SOME value, and a total that falls short of 1 is a direct signal that a genuinely possible value never made it into the working at all — not just an arithmetic slip to hunt for.
- sum-to-1-equation-not-written-downfudged-reverse-fit
- The construction-side version of the same idea, confirmed directly: "many candidates scored the 2nd M mark but failed to write down the equation for the sum of probabilities = 1 for the first M mark" (Jun 2022, Q5(d)). This matters specifically on a "show that" item, where the target value is already printed on the page: reaching the correct final number without ever writing the equation that forces it isn't a shortcut, it's a derivation that never actually happened — see the marked-solution's WarrantCheck above for exactly this failure, built around this same real quote.
Retrieval — with feedback on every choice
A discrete random variable takes the values 1, 2, 3, 4 with , , , . A student checks that every one of these four numbers lies between 0 and 1, and concludes this is a valid probability function. Is the student's check sufficient?
A discrete random variable has , , , . Find .
A discrete random variable is Discrete Uniform on . Using symmetry, what is ?
A discrete random variable is Discrete Uniform on . Find .
Two fair four-sided spinners are used independently: spinner shows 1, 2, 3, 4 and spinner shows 2, 4, 6, 8, each value equally likely (both are discrete uniform distributions). What is ?
- p(x) = P(X=x): every value 0 ≤ p(x) ≤ 1, and Σp(x) = 1 over the WHOLE domain — check this sum before moving on.
- F(x₀) = P(X≤x₀) = Σp(x) for x≤x₀ — NOT in the formula booklet. Memorise it, and note the ≤, not <.
- Discrete uniform: every value in the domain equally likely, p(x) = 1/n for n values — values needn't be consecutive integers.
- Mean of a symmetric/evenly-spaced discrete uniform distribution: read off by symmetry, (min+max)/2. No shortcut exists for variance — sum every x²p(x) term.
- Documented WST01 examiner-report error: leaving a value (often x=0) out of the domain entirely — check Σp(x)=1 to catch it (Oct 2021, Q4(d)).
- Documented WST01 examiner-report error: solving for an unknown constant without ever writing down the Σp(x)=1 equation itself (Jun 2022, Q5(d)).
Not affiliated with or endorsed by Pearson Edexcel. The spec guidance quotes (5.1/5.2/5.4's own wording), the formula-booklet split (which formulae are printed versus expected from memory), and the two named examiner-report traps — the domain-omission error at Oct 2021 Q4(d) and the sum-to-1-equation omission at Jun 2022 Q5(d) — are transcribed from WST01-verified-facts.md, itself checked against the primary Pearson documents. The Jan 2025 Q1 worked-chain uses a REAL, verified question setup (two four-sided dice, R Discrete Uniform on {1,2,3,4} and B Discrete Uniform on {1,3,5,7}), and two of its answers are literally verified from the mark scheme: part (a)'s 'Discrete uniform' (B1) and part (b)'s P(R<3)=1/2. Every other numeric answer built on that setup — E(R)=2.5, E(B)=4, Var(B)=5, P(R+B≤5)=3/8, P(R²<B)=5/16 — is a VERIDIAN computation applied to the verified R and B distributions, not a literal transcription of the real mark scheme's own figures for those parts, which the research pass did not capture; each is flagged individually at the stage where it appears. The real question's part (g), an unknown value inside a cumulative-distribution-function table for a derived variable D, is deliberately not reconstructed here, since the research pass did not capture what D actually was. Every other numeric scenario in this lesson — every prequestion, the marked-solution's p(x)=kx² distribution and its k=1/14 answer, the chain-drill's spinner, and every MCQ scenario — is VERIDIAN-original, built and hand-checked to exercise the two documented traps and the spec's own guidance honestly, never dressed up as a past-paper reproduction. The M1/A1/B1 mark codes attached to those original questions are modelled on the general marking conventions verified in WST01-verified-facts.md §4 (what M, A and B marks mean, the cao rule, the 'oe' convention) — not transcribed from a real WST01 mark scheme, which for a question nobody at Pearson wrote does not exist. The marked-solution's WarrantCheck is the one deliberate exception: its `trap` field is the real, verbatim Jun 2022 Q5(d) quotation, used as intended — a genuine documented failure mode applied to teach a constructed example, not claimed as that example's own mark-scheme text.
A discrete random variable takes the values 1, 2, 3, 4 with , , , . A student checks that every one of these four numbers lies between 0 and 1, and concludes this is a valid probability function. Is the student's check sufficient?
- No — checking each value lies between 0 and 1 is necessary but not sufficient; the values must also sum to exactly 1, and here , so this is NOT a valid probability function
Correct. Both conditions have to hold together: for every value, AND over the whole domain. Here the four numbers individually look fine but the total is 0.9, not 1 — exactly the check a real WST01 examiner report recommends making explicitly rather than skipping (Oct 2021, Q4(d)).
- BYes — every individual value being between 0 and 1 is exactly what makes a probability function valid
This is the incomplete check itself, stated as if it were sufficient. A set of numbers can each look like a perfectly reasonable individual probability and still fail to be a valid probability function together, if their total isn't 1.
- CNo — because repeats the value 0.3 from , which isn't allowed
Two different values of are entirely allowed to share the same probability — nothing about a probability function forbids repeated numbers. The actual problem here is the total, not a repeated value.
- DCannot be determined without knowing what represents
Whether form a valid probability function is a purely arithmetic question — it doesn't depend on the real-world meaning of X, only on whether the two defining conditions (each between 0 and 1; total exactly 1) hold.
Traps tested: Individual bounds treated as sufficient · Repeated probability value assumed invalid · Context assumed necessary for a purely arithmetic check
A discrete random variable has , , , . Find .
Correct — for (WST01-verified-facts.md §1/§2a), so sums every probability up to AND INCLUDING , not stopping just short of it.
- B, stopping before since means 'strictly less than'
is defined with , not — the cumulative distribution function includes the value itself. This is one of the formulae on this spec point explicitly NOT printed in the formula booklet (WST01-verified-facts.md §2a) — precisely because getting the versus right has to come from memory, not a lookup.
- C, treating as though it only looked at the single value 3
is CUMULATIVE — a running total up to , not the probability function evaluated at a single point. alone answers 'what is P(X=3)?', a different question from F(3) = P(X≤3).
- D, summing from upward instead of from the bottom of the domain
This computes , not — the cumulative distribution function always accumulates from the SMALLEST value in the domain up to , never the other direction.
Traps tested: Cdf boundary excluded · Cdf confused with probability function · Cdf summed in wrong direction
A discrete random variable is Discrete Uniform on . Using symmetry, what is ?
- — the values are evenly spaced and symmetric about their middle value, so sits exactly at that midpoint:
Correct. For a discrete uniform distribution on evenly-spaced values, the mean can be read off by symmetry — the average of the smallest and largest value — without summing all five terms individually, exactly the shortcut a real WST01 question explicitly signals is available (Jan 2025, Q1(c): E(R) and E(B) 'by symmetry').
- B, the smallest value, since that's where the distribution 'starts'
The mean of a symmetric distribution sits at its CENTRE, not its starting value — 3 is only the minimum, not a typical outcome; the middle value here is 9.
- C, dividing by instead of
The mean of equally likely values is their sum divided by — dividing by has no basis in the definition of at all, whatever the value of .
- DThe symmetry shortcut doesn't apply here, because 3, 6, 9, 12, 15 aren't consecutive integers
The shortcut only needs the values to be evenly SPACED and symmetric about a midpoint — it doesn't require consecutive integers. 3, 6, 9, 12, 15 are spaced 3 apart throughout, exactly what the symmetry argument needs; a real WST01 question uses the same idea on the non-consecutive set {1,3,5,7} (Jan 2025, Q1).
Traps tested: Mean confused with minimum value · Wrong power of n used · Symmetry shortcut assumed to need consecutive integers
A discrete random variable is Discrete Uniform on . Find .
- by symmetry; ;
Correct. The symmetry shortcut finds the mean quickly, but variance has no equivalent shortcut — every term has to be summed, exactly as a real WST01 question requires: 'Var(B) showing your working' (Jan 2025, Q1(d)) signals that no shortcut formula is expected to be quoted from memory here.
- B, since every value in a discrete uniform distribution is 'the same' in the sense of being equally likely
Equally LIKELY is not the same as equally SIZED — the three values 2, 4 and 6 are still spread out, and variance measures exactly that spread, not how the probabilities compare to each other.
- C, reusing the mean as the variance
and are two different quantities computed from two different formulae — there's no general reason they'd be equal, and here they aren't.
- D, using alone with no subtraction step
This is , not — the defining formula has a subtraction in it for a reason; dropping it leaves a different (and larger) quantity in variance's place.
Traps tested: Uniform likelihood confused with zero spread · Variance confused with mean · E x squared term used as variance
Two fair four-sided spinners are used independently: spinner shows 1, 2, 3, 4 and spinner shows 2, 4, 6, 8, each value equally likely (both are discrete uniform distributions). What is ?
- , multiplying the two independent probabilities together
Correct. Since the two spinners are spun independently, — the same combination rule a real WST01 question relies on to build the full 16-outcome table for two independent dice, one Discrete Uniform on {1,2,3,4} and the other on {1,3,5,7} (Jan 2025, Q1).
- B, adding the two probabilities
Adding is the rule for 'P=2 OR Q=2' (mutually exclusive events), not 'P=2 AND Q=2' on two independent spinners — for two things to both happen together, the probabilities multiply.
- C, since both spinners individually give the same probability of showing their respective '2'
This only accounts for ONE spinner, not both happening together — the combined event 'P shows 2 AND Q shows 2' is rarer than either single event on its own, and the correct probability has to reflect that.
- DCannot be found without knowing whether the two spinners are correlated
The question states the spinners are used INDEPENDENTLY — exactly the condition needed to multiply their probabilities directly, with nothing further to establish.
Traps tested: And probability computed by adding · Joint event treated as single event · Independence assumed insufficient
Practice this for real
This site teaches the mechanism; the exam is sat on Pearson's own real questions. Go find and attempt these yourself — nothing here substitutes for actually sitting a timed paper.
- Mark scheme
- Jan 2025 · Q1(a) — cited directly in this lesson
Select International Advanced Level → Mathematics → any series, then look for WST01.
Up next
E(aX+b) and Var(aX+b) for discrete random variables
Adding a constant to every outcome of a random variable slides its mean sideways and leaves its spread completely untouched; multiplying by a constant does the opposite — it scales the mean by that constant once, and the spread by that constant twice, because variance is built from a squared deviation in the first place. Two separate WST01 exam sittings, three years apart, produced the identical one-line slip three times over: multiplying the variance by a instead of a^2. This lesson exists because that error is not a memory lapse to drill away — it is what happens when a formula is memorised without ever being asked why the square is there.
35 min