communicate rationality and state conclusion 4,5,6,7
which is rational; contrapositive is true and which implies original statement is true
(3)
Notes:
At •2, the expression must be consistent with the candidate’s response to (a). For example, if in (a), a candidate’s attempt at writing the contrapositive has an antecedent relating to \(r\), •2 is awarded where the candidate proceeds from consideration of the form of \(r\). See CORs C and D.
At •2, do not accept a fraction which contains the letter \(r\), eg \(\sqrt{r}=\dfrac{r}{s}\).
Where a candidate’s response uses contradiction, •2 and •3 are available but •4 is not.
Do not withhold •3 for the omission of \(q\neq0\).
Where a candidate produces a ‘contrapositive’ which contains ‘If \(r\) is rational’ or ‘If \(r\) is not rational’, •3 and •4 are not available.
For the award of •4, the statement about rationality must relate to a fraction. It must also be consistent with the candidate’s response to (a). For example, if in (a), a candidate’s attempt at writing the contrapositive ends with a statement about \(r\), •4 is awarded where the candidate concludes that \(r\) is rational.
For the award of •4, the conclusion must state that the contrapositive is true and also indicate that this implies the truth of the original statement, eg “so”, “\(\therefore\)” but not “and” or “,”.
Where a candidate produces an incorrect statement between eg \(r=\dfrac{p^2}{q^2}\) and the conclusion, •4 is not available.
Commonly Observed Responses:
COR A
If \(\sqrt{r}\) is rational then \(r\) is irrational.
\(\sqrt{r}=\dfrac{p}{q}\)
Award •2.
\(p,q\in\mathbb{Z},\ r=\dfrac{p^2}{q^2}\)
Award •3.
Do not award •4.
COR B
If \(\sqrt{r}\) is irrational then \(r\) is irrational/rational.
\(\sqrt{r}\neq\dfrac{p}{q}\)
Award •2.
Do not award •3 or •4.
COR C (following from “\(r\) is rational if \(\sqrt{r}\) is rational” – here, the antecedent is “\(\sqrt{r}\) is rational”) Full marks are available
COR D (following from “\(\sqrt{r}\) is rational if \(r\) is rational” – here, the antecedent is “\(r\) is rational”) Only •2 is available, and the candidate must begin with “\(r=\)”
12. Prove by induction that \(7^n+2\) is divisible by 3 for all \(n\in\mathbb{N}\). [5]
Marking instructions
Mark
Generic scheme
Illustrative scheme
•1
show true for \(n=1\) 1,2,3
\(7^1+2=9\) true for \(n=1\)
•2
assume true for \(n=k\) 3,4,5,6,7 and consider whether true for \(n=k+1\) 2,3
suitable statement and \(7^k+2\) is divisible by 3 or \(7^k+2=3m\), where \(m\in\mathbb{Z}\). and \(7^{k+1}+2=\ldots7^k\ldots\)
•3
write \(7^{k+1}+2\) in terms of \(7^k\) and 2
\(7\times7^k+2\)
•4
use inductive hypothesis 8
\(7(3m-2)+2\)
•5
write expression with factor of 3 and communicate 8,9
\(3(7m-4)\) and If true for \(n=k\) then true for \(n=k+1\). But true for \(n=1\). Therefore true for all \(n\in\mathbb{N}\) by induction.
(5)
Notes:
Accept eg “so true” if the candidate has begun with eg “\(n=1:\)”. The statement for •1 may appear at •5.
For the award of •1, full substitution (ie \(7^1\)) must appear.
Where a candidate uses divisibility notation incorrectly (eg 9|3), withhold the mark where it first appears, but not subsequently. This applies even if the candidate states or implies its meaning.
‘Consider \(n=k\)’, ‘Assume \(n=k\)’, ‘Let \(n=k\)’, ‘Assume \(n=k\) is true’, ‘True for \(n=k\)’.
A sufficient phrase for the award of •2 may appear at •5. For •2, unacceptable phrases for \(n=k\) contain:
‘Assume true \(\forall k\in\mathbb{N}\)’
For •2, unacceptable phrases for \(n=k+1\) contain:
‘Consider true for \(n=k+1\)’, ‘True for \(n=k+1\)’.
Do not award •2 for ‘\(7^k+2=3k\)’ or ‘\(7^k+2=3n\)’.
For the award of •2, the RHS of the expression for \(7^{k+1}+2=\ldots\) must be an expression containing \(7^k\), or it must be stated that there is a requirement to prove that it is equal to 3 times a letter which is not used elsewhere, or that \(7^{k+1}+2\) is divisible by 3.
Do not withhold •2 for the omission of a source set.
For candidates who have not been awarded •4, •5 is unavailable.
Following the required algebra and statement of the inductive hypothesis, the minimal acceptable communication for •5 is “Then true for \(n=k+1\). But since true for \(n=1\), then true for all \(n\)”, or equivalent.
Commonly Observed Responses:
COR A (Express \(7^{k+1}+2\) as \((6+1)7^k+2\))
\(7\times7^k+2\) or \((6+1)7^k+2\)
•3
\(6\times7^k+3m\)
•4
\(3\left(2\times7^k+m\right)\) and communication.
•5
COR B (Express \(7^{k+1}+2\) as \(7\left(7^k+2\right)-14+2\))
\(7\times7^k+2\) or \(7\left(7^k+2\right)-14+2\)
•3
\(7\times3m-14+2\)
•4
\(3(7m-4)\) and communication.
•5
COR C (Candidate does not write \(7^k+2=3m\) but has, instead, stated that this is a multiple of 3). eg
\(7\times7^k+2\)
•3
\(6\times7^k+7^k+2\)
•4
\(7^k+2\) is divisible by 3 and \(6\times7^k\) is divisible by 3 and so \(7^{k+1}+2\) is divisible by 3 and communication.
•5
COR D (repeated use of letter indicating divisibility in inductive hypothesis)
(a) Use the Euclidean algorithm to find \(d\), the greatest common divisor of 1428 and 567. [1]
(b) Find integers \(a\) and \(b\) such that \(1428a+567b=d\). [2]
Marking instructions (a)
Mark
Generic scheme
Illustrative scheme
•1
obtain and identify \(d\) 1,2
eg \(1428=2\times567+294\), leading to eg 21or gcd = 21
(1)
Notes:
The gcd must be clearly identified in (a) or, if not identified in (a), implied by its use in (b).
There must be evidence of the Euclidean algorithm or a related process.
Marking instructions (b)
Mark
Generic scheme
Illustrative scheme
•2
express gcd in terms of 567 and 294 1,2,3
\(21=294-1\times(567-1\times294)\ldots\)
•3
determine \(a\) and \(b\) 1,3,4,5
\(a=2\), \(b=-5\)
(2)
Notes:
For the correct answer with no working, award 0/2.
At •2, the expression may involve 567, 294 and 1428.
Where a candidate misidentifies the gcd in part (a), •2 and •3 are still available for the appearance of “\(21=\ldots\)” accompanied by appropriate working. Otherwise, award 0/2.
At •3, the minimum requirement is \(1428\times(2)+567\times(-5)=21\).
Do not accept \(21=2\times1428-5\times567\) as a final answer.
when \(n=1\) \(\dfrac{1}{(2+1)(2-1)}=\dfrac{1}{3}\) \(\dfrac{1}{2+1}=\dfrac{1}{3}\) so true for \(n=1\)
•2
assume (statement) true for \(n=k\) AND consider case of \(n=k+1\) (RHS of final expression must not be the aim/goal unless it is identified as such) 2,3,4,5,6,10
suitable statement AND \(\displaystyle\sum_{r=1}^{k}\frac{1}{(2r+1)(2r-1)}=\frac{k}{2k+1}\) AND \(\displaystyle\sum_{r=1}^{k+1}\frac{1}{(2r+1)(2r-1)}=\ldots\)
•3
correct statement for sum to \((k+1)\) terms using inductive hypothesis 2,7
express sum to \((k+1)\) terms as a single term 2,8
\(\dfrac{(2k+3)k+1}{(2k+1)(2k+3)}\) or equivalent
•5
express sum explicitly in terms of \((k+1)\) or achieve stated aim/goal AND communicate 2,8,9,10,11
\(\dfrac{k+1}{2(k+1)+1}\) AND If true for \(n=k\) then true for \(n=k+1\). Also shown true for \(n=1\) therefore, by induction, true for all positive integers \(n\).
(5)
Notes:
“RHS = \(\dfrac{1}{3}\), LHS = \(\dfrac{1}{3}\)” and/or “True for \(n=1\)” are insufficient for the award of •1. A candidate must demonstrate some evidence of substitution into both expressions. Where a candidate does not independently evaluate the LHS and RHS, •1 may still be awarded. Communication that the statement is true for \(n=1\) may appear in the final statement.
Where \(n\) is used in place of \(k\), marks •2, •3, •4 and •5 are not available.
“Consider \(n=k\),”, “Assume \(n=k\) is true”, “True for \(n=k\)”, “Let \(n=k\)”
A sufficient phrase for the award of •2 may appear at •5.
For •2, the RHS of final expression must not be the aim/goal unless it is identified as such, or subsequent decomposition of \(\displaystyle\sum_{r=1}^{k+1}\frac{1}{(2r+1)(2r-1)}\) appears.
For •2 unacceptable phrases for \(n=k+1\) contain:
“Consider true for \(n=k+1\)”, “true for \(n=k+1\)”.
Since •3 may be awarded directly after •2, exercise leniency for the award of •3 in relation to intermediate notation where this has been provided, eg the handling of sigma notation.
Do not award •4 or •5 where one of the fractions is numeric.
For candidates who write down the correct expression without algebraic justification, •5 is unavailable.
Full marks are available to candidates who state an aim/goal earlier in the proof and who subsequently achieve the stated aim/goal provided the substitution of \(k+1\) is clearly shown.
Following the required algebra and statement of the inductive hypothesis, the minimal acceptable response for •5 must contain:
if true for \(n=k\) then true for \(n=k+1\) (do not accept “eg \(n=k\) is true”)
true for \(n=1\)
true for all \(n\) (do not accept “for all integers”).
12. Prove by induction that, for all positive integers \(n\), \(\displaystyle\sum_{r=1}^{n}2^{r-1}r=2^n(n-1)+1\). [5]
Marking instructions
Mark
Generic scheme
Illustrative scheme
•1
show true for \(n=1\) 1
\((\text{LHS}=)\,2^{1-1}\times1=1\) \((\text{RHS}=)\,2^1(1-1)+1=1\) so result is true when \(n=1\)
•2
assume statement true for \(n=k\) AND consider whether statement true for \(n=k+1\) 2,5
suitable statement AND \(\displaystyle\sum_{r=1}^{k}2^{r-1}r=2^k(k-1)+1\) AND \(\displaystyle\sum_{r=1}^{k+1}2^{r-1}r=\cdots\)
•3
state sum to \(k+1\) terms using inductive hypothesis 3
\(2^k(k-1)+1+(k+1)2^{k+1-1}\) or \(2^k(k-1)+1+(k+1)2^k\)
•4
take out common factor of \(2^k\) and simplify 4
\(2^k\cdot2k+1\)
•5
express sum explicitly in terms of \((k+1)\) or achieve stated aim/goal AND communicate 5,6,7
\(2^{(k+1)}\left(k+1-1\right)+1\) AND If true for \(n=k\) then true for \(n=k+1\). Also true for \(n=1\) therefore, by induction, true for all positive integers \(n\)
(5)
Notes:
“RHS = 1, LHS = 1” and/or “True for \(n=1\)” are insufficient for the award of •1. Where a candidate does not independently evaluate LHS and RHS, •1 may still be awarded.
‘Consider \(n=k\)’, ‘assume \(n=k\)’, ‘assume \(n=k\) is true’ and ‘True for \(n=k\)’.
A sufficient phrase for the award of •2 may appear at •5.
For •2, accept:
assume true for \(n=k\) AND \(\displaystyle\sum_{r=1}^{k}2^{r-1}r=2^k\left(k-1\right)+1\) AND “Aim/goal: \(\displaystyle\sum_{r=1}^{k+1}2^{r-1}r=2^{k+1}\left(k+1-1\right)+1\)”
For •2 unacceptable phrases for \(n=k+1\) contain:
“Consider true for \(n=k+1\)”, “true for \(n=k+1\)”,
“\(\displaystyle\sum_{r=1}^{k+1}2^{r-1}r=2^{k+1}\left(k+1-1\right)+1\)” (with no reference to aim/goal and no further processing).
Since •3 may be awarded directly after •2, exercise leniency in relation to intermediate notation where this has been provided, eg the handling of sigma notation.
•4 is unavailable to candidates who arrive at \(2^k\cdot2k+1\) without algebraic justification.
•5 is unavailable to candidates who have not been awarded •4.
Full marks are available to candidates who state an aim/goal earlier in the proof and who subsequently achieve the stated aim/goal, provided \(2^{k+1}\left(k+1-1\right)+1\) appears at some point.
Following the required algebra and statement of the inductive hypothesis, the minimal acceptable response for •5 is: “Then true for \(n=k+1\), but since true for \(n=1\), then true for all \(n\)” or equivalent.
For all integers \(a\) and \(b\), if \(a\lt b\) then \(a^2\lt b^2\).
Find a counterexample to show that the statement is false. [1]
(b) Let \(n\) be an odd integer. Prove directly that \(n^2-1\) is divisible by 4. [2]
Marking instructions (a)
Mark
Generic scheme
Illustrative scheme
•1
provide counterexample and demonstrate 1,2,3
\(a=-2, b=1\) 4 is not less than 1 or \(4\gt 1\)
(1)
Notes:
The values of \(a\) and \(b\) must be explicitly stated and the squares evaluated.
Disregard any statement following a suitable demonstration.
Where a candidate chooses eg \(a=-2\) and \(b=2\), then it is sufficient to observe that \(4=4\).
Marking instructions (b)
Mark
Generic scheme
Illustrative scheme
•2
appropriate form for \(n\) 1,2
eg \(2k+1\), \(k\in\mathbb{Z}\)
•3
factorise and communicate 3,4,5
\(4\left(k^2+k\right)\) and eg which is divisible by \(4\)
(2)
Notes:
At •2, accept eg “\(k\) is an integer” but do not accept eg \(k\in\mathbb{N}\), \(k\in\mathbb{Z}^{+}\).
Expression for \(n\) must be of the form \(2k+m\), where \(m\) is an odd integer.
At •3, accept \(4k(k+1)\) for the factorisation.
Award •3 if a candidate does not factorise but states that each term or coefficient (or equivalent) is divisible by 4.
Acceptable communication for •3 includes “therefore true”, “\(\Rightarrow\) true”, “so statement is true”, “as required”. Simply writing “true” after factorised expression is insufficient.
simplify to appropriate form and communicate result 4, 5, 6
\(\begin{pmatrix}3^{k+1}&3-3^{k+1}-2\\0&1\end{pmatrix}\) leading to \(\begin{pmatrix}3^{k+1}&1-3^{k+1}\\0&1\end{pmatrix}\) so if result is true for \(n=k\) then it is true for \(n=k+1\). But it is true for \(n=1\) and so it is true \(\forall n\in N\) by mathematical induction.
(5)
Notes:
‘\(A=\begin{pmatrix}3&-2\\0&1\end{pmatrix}\), \(A^1=\begin{pmatrix}3&-2\\0&1\end{pmatrix}\)’ and/or ‘True for n =1’ are insufficient for the award of •1. A candidate must demonstrate evidence of substitution.
‘Consider \(n=k\)’, ‘assume \(n=k\)’, ‘assume \(n=k\) is true’ and ‘True for \(n=k\)’.
A sufficient phrase for the award of •2 may appear at •5.
For •2, accept:
assume true for \(n=k\) AND \(A^k=\begin{pmatrix}3^k&1-3^k\\0&1\end{pmatrix}\) AND ‘Aim/goal: \(A^{k+1}=\begin{pmatrix}3^{k+1}&1-3^{k+1}\\0&1\end{pmatrix}\)’.
For •2 unacceptable phrases for \(n=k+1\) contain:
‘Consider true for \(n=k+1\)’, ‘true for \(n=k+1\)’;
‘\(A^{k+1}=\begin{pmatrix}3^{k+1}&1-3^{k+1}\\0&1\end{pmatrix}\)’ (with no reference to aim/goal or no further processing).
Award •4 where products resulting in zero are shown.
•5 is unavailable to candidates who write down the correct expression without algebraic justification.
Full marks are available to candidates who state an aim/goal earlier in the proof and who subsequently reference the stated aim/goal.
Following the required algebra and statement of the inductive hypothesis, the minimum acceptable response for •5 is ‘Then true for \(n=k+1\), but since true for \(n=1\), then true for all \(n\)’ or equivalent.
\(\begin{pmatrix}3^k\times 3&3^k\times\left(-2\right)+1-3^k\\0&1\end{pmatrix}\) stated or implied by
•4
\(\begin{pmatrix}3^{k+1}&3^k\times\left(-2\right)+1-3^k\\0&1\end{pmatrix}\) leading to \(\begin{pmatrix}3^{k+1}&1-3^{k+1}\\0&1\end{pmatrix}\)
•5
so if result is true for \(n=k\) then it is true for \(n=k+1\). But it is true for \(n=1\) and so it is true \(\forall n\in N\) by mathematical induction.
3. Use the Euclidean algorithm to find integers \(a\) and \(b\) such that
\[634a+87b=1.\]
[3]
Marking instructions
Mark
Generic scheme
Illustrative scheme
\(634=7\times 87+25\)
•1
start process and obtain remainder of 1
\(87=3\times 25+12\) \(25=2\times 12+1\)
•2
express gcd in terms of 87 and 25
\(1=25-2\left(87-3\times 25\right)\)
•3
obtain \(a\) and \(b\) 1
\(a=7\quad b=-51\)
(3)
Notes:
At •3, where candidates do not explicitly communicate \(a\) and \(b\), accept eg \(634\times 7+87\times -51=1\) or \(634\times 7+-51\times 87=1\). Do not accept \(634\times 7-87\times 51=1\) or \(634\times 7-51\times 87=1\).
We'd like to use Google Analytics cookies to count visits and see which pages help most. They're optional, and the site works exactly the same either way. Privacy policy