A Level Paper 5: Mixed Practice A
Covers proof by induction, series and summation, roots of polynomials, polar coordinates, further mechanics, and further statistics.
Questions
Question 1 [3 marks]
Polar Coordinates
Convert the polar coordinates (r, theta) = (8, pi/3) to Cartesian coordinates, giving exact values.
Question 2 [3 marks]
Further Statistics
The discrete random variable Y follows a Poisson distribution with mean 2.5.
Find P(Y = 3), giving your answer to 4 decimal places.
Question 3 [4 marks]
Further Mechanics
A particle of mass 3 kg moving at 6 m/s collides with a particle of mass 5 kg moving at 2 m/s in the same direction. The particles coalesce on impact.
Find their common speed immediately after the collision.
Question 4 [4 marks]
Series and Summation
Use the standard result for the sum of r^3 to find the sum of r^3 for r = 1 to 12.
Question 5 [4 marks]
Roots of Polynomials
The roots of x^3 - 6x^2 + 11x - 6 = 0 are alpha, beta and gamma.
Find the value of 1/alpha + 1/beta + 1/gamma, and the value of alpha^2 + beta^2 + gamma^2.
Question 6 [4 marks]
Further Statistics
A four-sided spinner is tested for fairness by spinning it 80 times. The observed frequencies for faces 1, 2, 3 and 4 are 24, 18, 22 and 16.
Test, at the 5% significance level, whether the spinner is fair, using a chi-squared goodness of fit test. The critical value of chi-squared with 3 degrees of freedom at the 5% level is 7.815.
Question 7 [5 marks]
Proof by Induction
Prove by induction that 3^(2n) - 1 is divisible by 8 for all positive integers n.
Question 8 [4 marks]
Series and Summation
Find the sum of (2r+3)(r-1) for r = 1 to n, giving your answer in terms of n in a fully factorised form.
Question 9 [5 marks]
Proof by Induction
The matrix M = [[3, 0], [1, 1]].
Prove by induction that M^n = [[3^n, 0], [(3^n - 1)/2, 1]] for all positive integers n.
Question 10 [6 marks]
Series and Summation
Given that (r+1)^3 - r^3 = 3r^2 + 3r + 1, use the method of differences on this identity to show that the sum of r^2 for r = 1 to n is n(n+1)(2n+1)/6.
Hence evaluate the sum of r^2 for r = 1 to 25.
Question 11 [6 marks]
Further Statistics
A single observation of X ~ B(10, p) is used to test H0: p = 0.3 against H1: p > 0.3, using the critical region X >= 6.
Find the probability of a Type I error. Given that the true value of p is actually 0.5, find the probability of a Type II error.
Question 12 [6 marks]
Series and Summation
Let S = the sum of r x 3^r for r = 1 to n. By considering S - 3S, find S in terms of n.
Hence evaluate S for n = 5.
Question 13 [6 marks]
Proof by Induction
Prove by induction that the sum of r times r! for r = 1 to n is (n+1)! - 1, for all positive integers n.
Model solutions
| Question 1[3 marks] | |
|---|---|
| Answer or working | Marks |
| x = r cos(theta) = 8 cos(pi/3) | M1 |
| y = r sin(theta) = 8 sin(pi/3) | M1 |
| (x, y) = (4, 4 sqrt(3)) | A1 |
| Final answer: (4, 4 sqrt(3)) | |
| Question 2[3 marks] | |
|---|---|
| Answer or working | Marks |
| P(Y=3) = e^(-2.5) x 2.5^3 / 3! | M1 |
| evaluating e^(-2.5) x 15.625 / 6 | M1 |
| P(Y=3) = 0.2138 (4 dp) | A1 |
| Final answer: 0.2138 | |
| Question 3[4 marks] | |
|---|---|
| Answer or working | Marks |
| momentum before collision = 3x6 + 5x2 | M1 |
| total momentum = 28 | A1 |
| conservation of momentum: (3+5)v = 28 | M1 |
| v = 3.5 m/s | A1 |
| Final answer: 3.5 m/s | |
| Question 4[4 marks] | |
|---|---|
| Answer or working | Marks |
| using sum of r^3 = [n(n+1)/2]^2 with n = 12 | M1 |
| substituting to get [12 x 13/2]^2 | M1 |
| [78]^2 | A1 |
| 6084 | A1 |
| Question 5[4 marks] | |
|---|---|
| Answer or working | Marks |
| sum of roots = 6, sum of pairwise products = 11, product of roots = 6 from the coefficients | M1 |
| 1/alpha + 1/beta + 1/gamma = 11/6 | A1 |
| alpha^2+beta^2+gamma^2 = (alpha+beta+gamma)^2 - 2(alpha beta + beta gamma + gamma alpha) | M1 |
| alpha^2 + beta^2 + gamma^2 = 14 | A1 |
| Final answer: 1/alpha + 1/beta + 1/gamma = 11/6; alpha^2 + beta^2 + gamma^2 = 14 | |
| Question 6[4 marks] | |
|---|---|
| Answer or working | Marks |
| expected frequency = 80/4 = 20 for each face | M1 |
| chi-squared = the sum of (O-E)^2/E | M1 |
| chi-squared = 2 | A1 |
| a correct conclusion: since 2 < 7.815, do not reject H0, no evidence the spinner is unfair | A1 |
| Final answer: chi-squared = 2; not significant, do not reject H0 (spinner appears fair) | |
| Question 7[5 marks] | |
|---|---|
| Answer or working | Marks |
| verifying the base case n = 1: 3^2 - 1 = 8, divisible by 8 | B1 |
| assuming 3^(2k) - 1 = 8m for some integer m, so 3^(2k) = 8m + 1 | M1 |
| writing 3^(2(k+1)) - 1 = 9 x 3^(2k) - 1 | M1 |
| substituting to get 9(8m+1) - 1 = 8(9m+1) | A1 |
| a correct conclusion for all positive integers n | B1 |
| Final answer: Result proved true for all positive integers n by induction | |
| Question 8[4 marks] | |
|---|---|
| Answer or working | Marks |
| expanding (2r+3)(r-1) = 2r^2 + r - 3 | M1 |
| using sum of r^2 = n(n+1)(2n+1)/6 and sum of r = n(n+1)/2, combined over a common denominator of 6 | M1 |
| factorising the numerator to n(n-1)(4n+13) | A1 |
| n(n-1)(4n+13)/6 | A1 |
| Question 9[5 marks] | |
|---|---|
| Answer or working | Marks |
| verifying the base case n = 1: M^1 = [[3,0],[1,1]] | B1 |
| assuming true for n = k, so M^k = [[3^k,0],[(3^k-1)/2,1]] | M1 |
| computing M^(k+1) = M^k times M using matrix multiplication | M1 |
| M^(k+1) = [[3^(k+1), 0], [(3^(k+1)-1)/2, 1]] | A1 |
| a correct conclusion for all positive integers n | B1 |
| Final answer: Result proved true for all positive integers n by induction | |
| Question 10[6 marks] | |
|---|---|
| Answer or working | Marks |
| summing the identity from r = 1 to n so the left side telescopes to (n+1)^3 - 1 | M1 |
| writing the right side as 3S + 3(sum of r) + n, where S is the sum of r^2 | M1 |
| substituting sum of r = n(n+1)/2 and simplifying the right side over a common denominator | M1 |
| simplifying to 3S = (2n^3 + 3n^2 + n)/2 | A1 |
| S = n(n+1)(2n+1)/6 | A1 |
| evaluating at n = 25 to get 5525 | A1 |
| Final answer: sum of r^2 = n(n+1)(2n+1)/6; sum for r = 1 to 25 is 5525 | |
| Question 11[6 marks] | |
|---|---|
| Answer or working | Marks |
| the probability of a Type I error = P(X>=6) under X ~ B(10, 0.3) | M1 |
| computing P(X>=6) = 1 - P(X<=5) by summing the binomial probabilities | M1 |
| P(X>=6) = 0.0473 (3 s.f.) | A1 |
| the probability of a Type II error = P(X<=5) under X ~ B(10, 0.5), since this accepts H0 when H1 (p=0.5) is true | M1 |
| summing C(10,k)(0.5)^10 for k = 0 to 5, using (0.5)^10 = 1/1024 | M1 |
| P(Type II error) = 0.623 (3 s.f.) | A1 |
| Final answer: P(Type I error) = 0.0473 (3 s.f.); P(Type II error) = 0.623 (3 s.f.) | |
| Question 12[6 marks] | |
|---|---|
| Answer or working | Marks |
| defining S and forming 3S by shifting the index | M1 |
| subtracting to get -2S = 3 + (3^2+3^3+...+3^n) - n x 3^(n+1) | M1 |
| using the geometric sum 3^2+3^3+...+3^n = (3^(n+1) - 9)/2 | M1 |
| S = [3 + 3^(n+1)(2n-1)] / 4 | A1 |
| substituting n = 5 | M1 |
| S = 1641 | A1 |
| Final answer: S = [3 + 3^(n+1)(2n-1)]/4; S = 1641 when n = 5 | |
| Question 13[6 marks] | |
|---|---|
| Answer or working | Marks |
| verifying the base case n = 1: LHS = 1 x 1! = 1, RHS = 2! - 1 = 1 | B1 |
| assuming true for n = k, so the sum to k terms is (k+1)! - 1 | M1 |
| adding the (k+1)th term (k+1) x (k+1)! to both sides | M1 |
| factorising (k+1)! out of (k+1)! - 1 + (k+1)(k+1)! | M1 |
| simplifying (k+1)!(k+2) - 1 to (k+2)! - 1 | A1 |
| a correct conclusion for all positive integers n | B1 |
| Final answer: Result proved true for all positive integers n by induction | |