OCR Further Additional Pure AS Specimen — Question 5 15 marks

Exam BoardOCR
ModuleFurther Additional Pure AS (Further Additional Pure AS)
SessionSpecimen
Marks15
PaperDownload PDF ↗
Mark schemeDownload PDF ↗
TopicSequences and Series
TypeModelling with Recurrence Relations
DifficultyStandard +0.3 This is a standard first-order linear recurrence relation question with straightforward applications. Parts (i)-(iii) involve routine explanation, solving using standard methods (finding particular solution and complementary function), and substitution. Part (iv) adds a ceiling function but is conceptually simple. The question requires multiple steps but uses well-practiced techniques with no novel insight required, making it slightly easier than average for Further Maths.
Spec8.05a 3D surfaces: z = f(x,y) and implicit form, partial derivatives8.05d Partial differentiation: first and second order, mixed derivatives8.05e Stationary points: where partial derivatives are zero

5 Let \(\mathrm { f } ( x , y ) = x ^ { 3 } + y ^ { 3 } - 2 x y + 1\). The surface \(S\) has equation \(z = \mathrm { f } ( x , y )\).
  1. (a) Find \(f _ { x }\).
    (b) Find \(\mathrm { f } _ { y }\).
    (c) Show that \(S\) has a stationary point at ( \(0,0,1\) ).
    (d) Find the coordinates of the second stationary point of \(S\).
  2. The section \(z = \mathrm { f } ( a , y )\), where \(a\) is a constant, has exactly one stationary point. Determine the equation of the section. A customer takes out a loan of \(\pounds P\) from a bank at an annual interest rate of \(4.9 \%\). Interest is charged monthly at an equivalent monthly interest rate. This interest is added to the outstanding amount of the loan at the end of each month, and then the customer makes a fixed monthly payment of \(\pounds M\) in order to reduce the outstanding amount of the loan. Let \(L _ { n }\) denote the outstanding amount of the loan at the end of month \(n\) after the fixed payment has been made, with \(L _ { 0 } = P\).
  3. Explain how the outstanding amount of the loan from one month to the next is modelled by the recurrence relation $$L _ { n + 1 } = 1.004 L _ { n } - M$$ with \(L _ { 0 } = P , n \geq 0\).
  4. Solve, in terms of \(n , M\) and \(P\), the first order recurrence relation given in part (i).
  5. The loan amount is \(\pounds 100000\) and will be fully repaid after 10 years. Find, to the nearest pound, the value of the monthly repayment.
  6. The bank's procedures only allow for calculations using integer amounts of pounds. When each monthly amount of the outstanding \(\operatorname { debt } \left( L _ { n } \right)\) is calculated it is always rounded up to the nearest pound before the monthly repayment ( \(M\) ) is subtracted.
    Rewrite (*) to take this into account.
  7. Let \(N = 10 a + b\) and \(M = a - 5 b\) where \(a\) and \(b\) are integers such that \(a \geq 1\) and \(0 \leq b \leq 9\). \(N\) is to be tested for divisibility by 17 .
    (a) Prove that \(17 \mid N\) if and only if \(17 \mid M\).
    (b) Demonstrate step-by-step how an algorithm based on these forms can be used to show that \(17 \mid 4097\).
  8. (a) Show that, for \(n \geq 2\), any number of the form \(1001 _ { n }\) is composite.
    (b) Given that \(n\) is a positive even number, provide a counter-example to show that the statement "any number of the form \(10001 _ { n }\) is prime" is false. \section*{END OF QUESTION PAPER} }{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 Copyright Team, First Floor, 9 Hills Road, Cambridge CB2 1GE.
    OCR is part of the

Question 5:
AnswerMarks Guidance
5(i) (a)
xB1
[1]1.1
5(i) (b)
yB1
[1]1.1
5(i) (c)
Substituting e.g. y(cid:32) 3x2into y2 (cid:32) 2x
2 3
27x4 (cid:16)8x(cid:32)0
x(cid:32)0 or x(cid:32) 2
3
so S has a stationary point when x = 0 as
required
AnswerMarks
(cid:159) (x, y, z) = (0, 0, 1)M1
M1
M1
A1
A1
AnswerMarks
[6]1.1a
3.1a
1.1
1.1
AnswerMarks
1.1Eliminating one variable
Solving their quarticOR M13x2 (cid:16)2y(cid:32) 3y2 (cid:16)2x
(cid:159) (x – y){3(x + y) + 2} = 0
(cid:159) x = y or x + y = (cid:16)2
3
M1 Eliminating 2nd case since both
x, y are positive (y(cid:32) 3x2&
2
x(cid:32) 2 y2) or from
3
3x2 (cid:16)2((cid:16)2(cid:16)x)(cid:32)0
3
(cid:159) 9x2 (cid:14)6x(cid:14)4(cid:32)0 with (cid:39) < 0
M1 y = x (cid:159) x2 (cid:32) 2x, etc. as
3
before
AnswerMarks Guidance
5(i) (d)
3 3 27B1
[1]1.1
5(ii) When x = a, f (cid:32)3y2 (cid:16)2a(cid:32)0
y
y(cid:32)(cid:114) 3a , so one solution implies a = 0
2
z(cid:32)f(a,y)(cid:32) y3(cid:16)2ay(cid:14)1(cid:14)a3
Therefore the equation of the section is
AnswerMarks
z(cid:32) y3(cid:14)1M1
E1
A1
AnswerMarks
[3]3.1a
2.2a
3.2a
Question 5:
5 | (i) | (a) | f (cid:32)3x2 (cid:16)2y
x | B1
[1] | 1.1
5 | (i) | (b) | f (cid:32)3y2 (cid:16)2x
y | B1
[1] | 1.1
5 | (i) | (c) | 3x2 (cid:16)2y(cid:32)0 and 3y2 (cid:16)2x(cid:32)0
Substituting e.g. y(cid:32) 3x2into y2 (cid:32) 2x
2 3
27x4 (cid:16)8x(cid:32)0
x(cid:32)0 or x(cid:32) 2
3
so S has a stationary point when x = 0 as
required
(cid:159) (x, y, z) = (0, 0, 1) | M1
M1
M1
A1
A1
[6] | 1.1a
3.1a
1.1
1.1
1.1 | Eliminating one variable
Solving their quartic | OR M13x2 (cid:16)2y(cid:32) 3y2 (cid:16)2x
(cid:159) (x – y){3(x + y) + 2} = 0
(cid:159) x = y or x + y = (cid:16)2
3
M1 Eliminating 2nd case since both
x, y are positive (y(cid:32) 3x2&
2
x(cid:32) 2 y2) or from
3
3x2 (cid:16)2((cid:16)2(cid:16)x)(cid:32)0
3
(cid:159) 9x2 (cid:14)6x(cid:14)4(cid:32)0 with (cid:39) < 0
M1 y = x (cid:159) x2 (cid:32) 2x, etc. as
3
before
5 | (i) | (d) | (cid:11)2, 2, 19(cid:12)
3 3 27 | B1
[1] | 1.1
5 | (ii) | When x = a, f (cid:32)3y2 (cid:16)2a(cid:32)0
y
y(cid:32)(cid:114) 3a , so one solution implies a = 0
2
z(cid:32)f(a,y)(cid:32) y3(cid:16)2ay(cid:14)1(cid:14)a3
Therefore the equation of the section is
z(cid:32) y3(cid:14)1 | M1
E1
A1
[3] | 3.1a
2.2a
3.2a
5 Let $\mathrm { f } ( x , y ) = x ^ { 3 } + y ^ { 3 } - 2 x y + 1$. The surface $S$ has equation $z = \mathrm { f } ( x , y )$.\\
(i) (a) Find $f _ { x }$.\\
(b) Find $\mathrm { f } _ { y }$.\\
(c) Show that $S$ has a stationary point at ( $0,0,1$ ).\\
(d) Find the coordinates of the second stationary point of $S$.\\
(ii) The section $z = \mathrm { f } ( a , y )$, where $a$ is a constant, has exactly one stationary point. Determine the equation of the section.

A customer takes out a loan of $\pounds P$ from a bank at an annual interest rate of $4.9 \%$. Interest is charged monthly at an equivalent monthly interest rate. This interest is added to the outstanding amount of the loan at the end of each month, and then the customer makes a fixed monthly payment of $\pounds M$ in order to reduce the outstanding amount of the loan.

Let $L _ { n }$ denote the outstanding amount of the loan at the end of month $n$ after the fixed payment has been made, with $L _ { 0 } = P$.\\
(i) Explain how the outstanding amount of the loan from one month to the next is modelled by the recurrence relation

$$L _ { n + 1 } = 1.004 L _ { n } - M$$

with $L _ { 0 } = P , n \geq 0$.\\
(ii) Solve, in terms of $n , M$ and $P$, the first order recurrence relation given in part (i).\\
(iii) The loan amount is $\pounds 100000$ and will be fully repaid after 10 years. Find, to the nearest pound, the value of the monthly repayment.\\
(iv) The bank's procedures only allow for calculations using integer amounts of pounds. When each monthly amount of the outstanding $\operatorname { debt } \left( L _ { n } \right)$ is calculated it is always rounded up to the nearest pound before the monthly repayment ( $M$ ) is subtracted.\\
Rewrite (*) to take this into account.\\
(i) Let $N = 10 a + b$ and $M = a - 5 b$ where $a$ and $b$ are integers such that $a \geq 1$ and $0 \leq b \leq 9$. $N$ is to be tested for divisibility by 17 .\\
(a) Prove that $17 \mid N$ if and only if $17 \mid M$.\\
(b) Demonstrate step-by-step how an algorithm based on these forms can be used to show that $17 \mid 4097$.\\
(ii) (a) Show that, for $n \geq 2$, any number of the form $1001 _ { n }$ is composite.\\
(b) Given that $n$ is a positive even number, provide a counter-example to show that the statement "any number of the form $10001 _ { n }$ is prime" is false.

\section*{END OF QUESTION PAPER}
}{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 Copyright Team, First Floor, 9 Hills Road, Cambridge CB2 1GE.\\
OCR is part of the

\hfill \mbox{\textit{OCR Further Additional Pure AS  Q5 [15]}}