OCR Further Additional Pure AS (Further Additional Pure AS) 2024 June

1 In this question you must show detailed reasoning. The number \(N\) is written as 28 A 3 B in base-12 form. Express \(N\) in decimal (base-10) form.

2 The points \(A\) and \(B\) have position vectors \(\mathbf { a }\) and \(\mathbf { b }\) relative to the origin \(O\). It is given that \(\mathbf { a } = \left( \begin{array} { c } 2
4
3 \lambda \end{array} \right)\) and \(\mathbf { b } = \left( \begin{array} { r } \lambda
- 4
6 \end{array} \right)\), where \(\lambda\) is a real parameter.

1. In the case when \(\lambda = 3\), determine the area of triangle \(O A B\).
2. Determine the value of \(\lambda\) for which \(\mathbf { a } \times \mathbf { b } = \mathbf { 0 }\).

3 The surface \(S\) has equation \(z = f ( x , y )\), where \(f ( x , y ) = 4 x ^ { 2 } y - 6 x y ^ { 2 } - \frac { 1 } { 12 } x ^ { 4 }\) for all real values of \(x\) and \(y\). You are given that \(S\) has a stationary point at the origin, \(O\), and a second stationary point at the point \(P ( a , b , c )\), where \(\mathrm { c } = \mathrm { f } ( \mathrm { a } , \mathrm { b } )\).

1. Determine the values of \(a , b\) and \(c\).
2. Throughout this part, take the values of \(a\) and \(b\) to be those found in part (a).
   1. Evaluate \(\mathrm { f } _ { x }\) at the points \(\mathrm { U } _ { 1 } ( \mathrm { a } - 0.1 , \mathrm {~b} , \mathrm { f } ( \mathrm { a } - 0.1 , \mathrm {~b} ) )\) and \(\mathrm { U } _ { 2 } ( \mathrm { a } + 0.1 , \mathrm {~b} , \mathrm { f } ( \mathrm { a } + 0.1 , \mathrm {~b} ) )\).
   2. Evaluate \(\mathrm { f } _ { y }\) at the points \(\mathrm { V } _ { 1 } ( \mathrm { a } , \mathrm { b } - 0.1 , \mathrm { f } ( \mathrm { a } , \mathrm { b } - 0.1 ) )\) and \(\mathrm { V } _ { 2 } ( \mathrm { a } , \mathrm { b } + 0.1 , \mathrm { f } ( \mathrm { a } , \mathrm { b } + 0.1 ) )\).
   3. Use the answers to parts (b)(i) and (b)(ii) to sketch the portions of the sections of \(S\), given by
      • \(z = f ( x , b )\), for \(| x - a | \leqslant 0.1\),
3. \(z = f ( a , y )\), for \(| y - b | \leqslant 0.1\).

4 The first five terms of the Fibonacci sequence, \(\left\{ \mathrm { F } _ { \mathrm { n } } \right\}\), where \(n \geqslant 1\), are \(F _ { 1 } = 1 , F _ { 2 } = 1 , F _ { 3 } = 2 , F _ { 4 } = 3\) and \(F _ { 5 } = 5\).

1. Use the recurrence definition of the Fibonacci sequence, \(\mathrm { F } _ { \mathrm { n } + 1 } = \mathrm { F } _ { \mathrm { n } } + \mathrm { F } _ { \mathrm { n } - 1 }\), to express \(\mathrm { F } _ { \mathrm { n } + 4 }\) in terms of \(\mathrm { F } _ { \mathrm { n } }\) and \(\mathrm { F } _ { \mathrm { n } - 1 }\).
2. Hence prove by induction that \(\mathrm { F } _ { \mathrm { n } }\) is a multiple of 3 when \(n\) is a multiple of 4 .

5 The set \(S\) consists of all \(2 \times 2\) matrices having determinant 1 or - 1 . For instance, the matrices \(\mathbf { P } = \left( \begin{array} { c c } \frac { 1 } { 2 } & \frac { \sqrt { 3 } } { 2 }
- \frac { \sqrt { 3 } } { 2 } & \frac { 1 } { 2 } \end{array} \right) , \mathbf { Q } = - \left( \begin{array} { c c } \frac { 1 } { 2 } & \frac { \sqrt { 3 } } { 2 }
- \frac { \sqrt { 3 } } { 2 } & \frac { 1 } { 2 } \end{array} \right)\) and \(\mathbf { R } = \left( \begin{array} { r r } 1 & 0
0 & - 1 \end{array} \right)\) are elements of \(S\). It is given that \(\times _ { \mathbf { M } }\) is the operation of matrix multiplication.

1. State the identity element of \(S\) under \(\times _ { \mathbf { M } }\). The group \(G\) is generated by \(\mathbf { P }\), under \(\times _ { \mathbf { M } }\).
2. Determine the order of \(G\). The group \(H\) is generated by \(\mathbf { Q }\) and \(\mathbf { R }\), also under \(\times _ { \mathbf { M } }\).
3. 1. By finding each element of \(H\), determine the order of \(H\).
   2. List all the proper subgroups of \(H\).
4. State whether each of the following statements is true or false. Give a reason for each of your answers.
   • \(G\) is abelian
   • \(G\) is cyclic
   • \(H\) is abelian
   • \(H\) is cyclic

6 For positive integers \(n\), let \(f ( n ) = 1 + 2 ^ { n } + 4 ^ { n }\).

1. 1. Given that \(n\) is a multiple of 3 , but not of 9 , use the division algorithm to write down the two possible forms that \(n\) can take.
   2. Show that when \(n\) is a multiple of 3 , but not of 9 , \(f ( n )\) is a multiple of 73 .
2. Determine the value of \(\mathrm { f } ( n )\), modulo 73 , in the case when \(n\) is a multiple of 9 .

7 In a long-running biochemical experiment, an initial amount of 1200 mg of an enzyme is placed into a mixture. The model for the amount of enzyme present in the mixture suggests that, at the end of each hour, one-eighth of the amount of enzyme that was present at the start of that hour is used up due to chemical reactions within the mixture. To compensate for this, at the end of each six-hour period of time, a further 500 mg of the enzyme is added to the mixture.

1. Let \(n\) be the number of six-hour periods that have elapsed since the experiment began. Explain how the amount of enzyme, \(\mathrm { E } _ { \mathrm { n } } \mathrm { mg }\), in the mixture is given by the recurrence system \(E _ { 0 } = 1200\) and \(E _ { n + 1 } = \left( \frac { 7 } { 8 } \right) ^ { 6 } E _ { n } + 500\) for \(n \geqslant 0\).
2. Solve the recurrence system given in part (a) to obtain an exact expression for \(\mathrm { E } _ { \mathrm { n } }\) in terms of \(n\).
3. Hence determine, in the long term, the amount of enzyme in the mixture. Give your answer correct to \(\mathbf { 3 }\) significant figures.
4. In this question you must show detailed reasoning. The long-running experiment is then repeated. This time a new requirement is added that the amount of enzyme present in the mixture must always be at least 500 mg . Show that the new requirement ceases to be satisfied before 12 hours have elapsed. \section*{END OF QUESTION PAPER} OCR is committed to seeking permission to reproduce all third-party content that it uses in its assessment materials. OCR has attempted to identify and contact all copyright holders whose work is used in this paper. To avoid the issue of disclosure of answer-related information to candidates, all copyright acknowledgements are reproduced in the OCR Copyright Acknowledgements Booklet. This is produced for each series of examinations and is freely available to download from our public website (\href{http://www.ocr.org.uk}{www.ocr.org.uk}) after the live examination series.
   If OCR has unwittingly failed to correctly acknowledge or clear any third-party content in this assessment material, OCR will be happy to correct its mistake at the earliest possible opportunity.
   For queries or further information please contact The OCR Copyright Team, The Triangle Building, Shaftesbury Road, Cambridge CB2 8EA.
   OCR is part of Cambridge University Press \& Assessment, which is itself a department of the University of Cambridge.