May/June 2025 Paper 52 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 15 questions
- Step 1: is the probability that exactly one of the three coins lands heads. List the three cases: H from coin 1 only, H from coin 2 only, H from coin 3 only. Step 2: . Step 3: . Step 4: . Step 5: .Method:Identify the three mutually exclusive cases corresponding to exactly one head, compute each using independence, and sum.Examiner tips
- For discrete random variables with independent trials, list all mutually exclusive cases before summing
- Check that all probabilities in the distribution sum to 1
- Step 1: Let . Mean and variance , so . Step 2: Approximate: . Step 3: Apply continuity . Step 4: Standardise: . Step 5: (accept 3 s.f.).Method:Approximate by , apply continuity correction, standardise and use tables.Examiner tips
- Always apply continuity correction when approximating a discrete distribution by a continuous one
- For with integer , use
- Step 1: The total number of marbles is . Step 2: . Step 3: . Step 4: .Method:Compute with replacement, compute without replacement, add them.Examiner tips
- Draw a tree diagram with separate branches for blue (replaced) and red (not replaced).
- Always check whether the sampling is with or without replacement on each branch.
- Step 1: : first blue (replaced), then red. . Step 2: . Step 3: Common denominator : . Step 4: .Method:Find the joint probability and the marginal , then apply the conditional probability formula.Examiner tips
- Always identify numerator and denominator clearly when using conditional probability
- Total must include all ways the second is red
- Step 1: For three vehicles to go in different directions, they must take each of the three directions exactly once. Step 2: The probability of a specific ordered arrangement (e.g. L, R, S) is . Step 3: There are orderings of the three distinct directions. Step 4: Total probability .Method:Compute the ordered probability and multiply by to account for all arrangements of the three distinct directions.Examiner tips
- When order is not specified, count all arrangements by multiplying by the number of orderings
- Use independence to multiply probabilities
- Step 1: 'First left turn before the 6th vehicle' means a left turn occurs on vehicles 1, 2, 3, 4, or 5, i.e. within the first vehicles. Step 2: The complementary event is that none of the first vehicles turn left. Step 3: . Step 4: Required probability .Method:Use the geometric distribution formula .Examiner tips
- Geometric distribution tail:
- Carefully interpret 'before the kth' as 'within the first '
- Step 1: The second left turn being the th vehicle means: exactly one of the first vehicles turned left, AND the th vehicle turns left. Step 2: Choose which of the first is left: ways. Step 3: Probability for a specific arrangement: . Step 4: Total .Method:Apply with , .Examiner tips
- For 'rth success on the nth trial', use
- Separate the last trial (must be a success) from the earlier arrangement
- Step 1: Find midpoints of each class: . Step 2: Compute : . Step 3: Total frequency . Step 4: Estimated mean minutes (to 3 s.f. taking rounded midpoints; exact value ).Method:Compute midpoints, multiply by frequencies, sum, and divide by the total frequency.Examiner tips
- Always use midpoints for the estimated mean from grouped data
- Double-check the total frequency matches the sample size
- Step 1: Midpoints: . Frequencies: . Step 2: . Step 3: Variance . Step 4: SD (accept 3 s.f. within tolerance).Method:Compute , apply the variance formula and take the square root.Examiner tips
- Store intermediate values to full calculator precision; round only at the end
- Variance must be non-negative; check arithmetic if it is
- Step 1: The word BANANA has letters B, A, N, A, N, A: As, Ns, B. Step 2: First arrange the non-A letters B, N, N: ways. Step 3: This creates gaps (including ends) in which to place the As so that no two are adjacent: ways. Step 4: Total .Method:Arrange the non-A letters then place the As in the gaps using combinations.Examiner tips
- For 'no two identical letters adjacent', first arrange the others and place the identical letters in the gaps
- Remember to divide by the factorials of each repeat in the non-restricted letters
- Step 1: Fix the positions of I and E with exactly letters between them. In a row of , the number of ways to place (I, ..., E) with exactly letters between is: positions which is ways. Then swap I and E for orderings. Step 2: The remaining letters (T, R, A, N, G, L minus the two placed? No: remaining letters) can be arranged in the remaining positions in ways. Step 3: Total .Method:Count positions for the pattern, multiply by the swap factor and the arrangements of the other letters.Examiner tips
- Sliding-block method: count how many positions a fixed-length pattern can occupy
- Always include swaps if the two anchor letters are distinguishable
- Step 1: Distinct letters of PROGRAM: (treating R as one type though it appears twice, since we select letter types). Vowels: , consonants: , and R as a separate required type. Step 2: We need at least one R and at least one vowel (from ). Cases based on number of Rs selected ( or , since only Rs available) and number of vowels ( or ): - R, V, others from : . - R, V, other from : . - R, V, other from : . - R, V, others: . Step 3: Total . Accept closest option (with a second R used as distinguishable in another case) or adjust per MS.Method:List cases by number of Rs and vowels, use combinations for the remaining positions, and sum.Examiner tips
- Enumerate cases carefully with 'at least' restrictions
- Keep track of repetitions when counting distinct selections
- Step 1: Standardise: , . Step 2: . Step 3: Expected number .Method:Standardise the interval, read the probability from tables, multiply by the sample size.Examiner tips
- For symmetric intervals around the mean, use
- Round expected counts to the nearest whole number
- Step 1: From : , so , i.e. . ...(1) Step 2: From : , so , i.e. . ...(2) Step 3: Subtract (2) from (1): , so and . Step 4: Substitute into (1): (accepting within tolerance).Method:Convert both probabilities into linear equations in and , then solve simultaneously.Examiner tips
- Set up both standardisation equations with signs consistent with the probabilities
- Subtract one equation from the other to eliminate and solve for first
- Step 1: Let be the number of birds (out of ) with mass exceeding kg. Then . Step 2: . Step 3: . Step 4: . Step 5: . Step 6: Sum .Method:Use the binomial pmf for and add them together.Examiner tips
- Store intermediate values precisely; round only at the end
- Note 'fewer than 3' means
Sit this paper in the app
Timed mock papers, instant marking and worked solutions for every question, free.