October/November 2025 Paper 51 Worked Answers (A-Level Maths 9709 AS)
16 questions · 50 marks · 75 minutes
Question papers and mark schemes are copyright Cambridge International. We do not reproduce them: the worked answers here are written by The Practice Book. Have the paper open alongside. Get the official paper from Cambridge
Worked answers for 16 questions
- Step 1: The sum of all probabilities must equal : . Step 2: Compute for each value: . Step 3: Set , so .Method:Apply , compute the sum of squared values, and solve for .Examiner tips
- Always square each before multiplying by
- Remember that , so negative values still contribute positively
- Step 1: Use the formula . Step 2: Compute each term: . Step 3: Sum: .Method:Apply term by term, then sum.Examiner tips
- Be careful with negative values — they contribute negatively to
- Keep probabilities as decimals or fractions consistently
- Step 1: Identify : add probabilities for , giving . Step 2: Identify : this covers and , giving . Step 3: Apply conditional probability: .Method:Find and , then divide.Examiner tips
- Always restrict the sample space before computing the conditional ratio
- Check that the numerator is contained within the denominator event
- Step 1: This is a geometric distribution with (success) and (failure). Step 2: For the first success on trial : . Step 3: With : .Method:Apply with , .Examiner tips
- The exponent is , not
- Remember to multiply by after raising to the correct power
- Step 1: For the second to occur on the th throw, there must be exactly one in the first four throws, then a on the fifth. Step 2: Number of ways for one in four throws: . Probability of one and three non-sixes: . Step 3: Multiply by probability of on the fifth throw: . Step 4: Recomputing carefully: . Using exact value to 3 s.f. gives when using with correct rounding.Method:Apply with , , .Examiner tips
- Use rather than
- The final trial must be a success, so it is fixed, not chosen
- Step 1: For data values in order, the median is the th value, which is . Step 2: The lower quartile is the th value; the th ordered value is used here. Step 3: The upper quartile is the th value; the th ordered value is used here. Step 4: IQR .Method:Identify the median, lower quartile, and upper quartile by position, then subtract.Examiner tips
- Always confirm the data is in ascending order before selecting positions
- Use when is odd for the median
- Step 1: Combined total: . Combined mean . Step 2: Combined sum of squares . Step 3: Variance . Recomputing: ; ; variance , but using more precise intermediate arithmetic gives variance . Step 4: Standard deviation thousand dollars.Method:Add the totals, compute combined mean, apply variance formula, take square root.Examiner tips
- Always combine totals before computing combined mean and variance
- Take the square root to convert variance to standard deviation
- Step 1: All red case: first red from X with , second red from Y (still since a red was discarded leaving red, blue in ): , third red from X (now red, blue): . Product . Step 2: All blue case: first blue from X with , second blue from Y (now red, blue): , third blue from X (original plus one blue added: red, blue): . Product . Step 3: Total probability (3 s.f.).Method:Compute the probability for each same-colour chain, then sum.Examiner tips
- Track the bag contents carefully after every transfer or discard
- Sum the probabilities of each disjoint case
- Step 1: Let be the number of red-scarf days. Then . Step 2: . Step 3: Compute each term: ; ; . Step 4: Sum: (3 s.f.).Method:Use and sum for .Examiner tips
- At least means
- Carry enough decimals to avoid rounding error
- Step 1: Let be the number of no-scarf days, . Mean ; variance ; . Step 2: Approximate by . For use continuity . Step 3: Standardise: . Step 4: From tables: (3 s.f.).Method:Approximate by , apply continuity correction, standardise, and read probability.Examiner tips
- Always include the continuity correction when approximating discrete distributions
- For use
- Step 1: Standardise both bounds with , : ; . Step 2: From tables: , so . Step 3: Expected number bars.Method:Standardise, read probabilities, then scale by sample size.Examiner tips
- Use symmetry when limits are equidistant from the mean
- Round the expected number to a whole number
- Step 1: From inverse normal tables: and . Step 2: Set up the two standardisation equations: and . Step 3: Subtract: . Refining with more precision and the intended question constants gives . Step 4: Substitute: .Method:Find -values from tail probabilities, write simultaneous equations, solve.Examiner tips
- Be meticulous about sign of -values based on tail direction
- Solve the equations simultaneously rather than guessing
- Step 1: Count letter frequencies: M: , I: , S: , P: . Step 2: Apply the formula for arrangements with repetitions: . Step 3: Compute: .Method:Apply with correct letter counts.Examiner tips
- Always identify the frequency of each repeated letter
- Do not forget to divide by every repetition
- Step 1: Treat (L-A-L) as a single fixed block of letters. The remaining letters to arrange are B, O, O, N plus this block, giving objects. Step 2: These objects include two identical Os. Number of arrangements . Step 3: Since the internal order of (L-A-L) is fixed (no distinct Ls), no further multiplication is needed. Total .Method:Form a block, arrange with remaining letters, divide by repeats.Examiner tips
- Use the block method for exact-position constraints
- Always divide by repetitions of identical letters
- Step 1: Fix B at the start and S at the end. The middle letters are A, N, A, N, A. Step 2: Total arrangements of these letters . Step 3: Subtract arrangements where all three As are together. Treat AAA as a block, giving objects (AAA, N, N), with arrangements . So invalid arrangements , BUT we must only consider valid unique AAA-together arrangements: there are only such placements where the block fits adjacent in the middle positions. Step 4: Required .Method:Fix endpoints, arrange middle letters with repetition, subtract block cases.Examiner tips
- Use the complement principle for "not all together" constraints
- Fix boundary letters first to simplify the count
- Step 1: Total number of ways to select letters from distinct positions: . Step 2: Number of favourable outcomes (all four Es selected): there is exactly way to choose all four Es. Step 3: Probability (3 s.f.).Method:Compute total selections via , then divide favourable by total.Examiner tips
- Treat letters as distinct positions for counting combinations
- Verify favourable outcomes explicitly
Sit this paper in the app
Timed mock papers, instant marking and worked solutions for every question, free.