Level:
Correct: 0
Incorrect: 0
Marks: 0/0
Exam Practice
Course:
Topics:
AQA Level 2 Further Maths (Calculator) Smart practice A mixed round aimed at your weak spots
Unit 1
Number
Unit 2
Algebra
Unit 3
Coordinate Geometry (2 dimensions only)
Unit 4
Calculus
Unit 5
Matrix Transformations
Unit 6
Geometry
Avg
score:
–
Topics
done:
0/43

Algebraic proof

Practise 17 exam-style questions on Algebraic proof for AQA Level 2 Further Maths (Calculator). Write your answer as you would in the exam and get it marked in seconds against the mark scheme, point by point, with the Study Helper on hand if you get stuck.

  • 17 questions
  • 1–6 marks each
  • Instant marking
  • No sign-up needed
17 questions, marked as you go

Sample questions with model answers

Here are 4 of the questions in this topic, each with a model answer, an explanation of why it earns the marks and the mark scheme an examiner would use.

Question 1

2 marks

Here is a statement.

'\((x + 3)^{2} > x^{2} + 9\) for all values of \(x\)'

Show that the statement is false.

Type powers with \(\text{\textasciicircum}\), for example \(\text{x\textasciicircum 2}\).

Model answer

When \(x = -1\):
\((x + 3)^{2} = (-1 + 3)^{2} = 2^{2} = 4\)
\(x^{2} + 9 = (-1)^{2} + 9 = 10\)
4 is not greater than 10
So \((x + 3)^{2} > x^{2} + 9\) is not true for all values of \(x\): the statement is false.

Explanation

One counterexample is enough to show that a statement 'for all values' is false. Expanding, \((x + 3)^{2} = x^{2} + 6x + 9\), which is greater than \(x^{2} + 9\) only when \(6x > 0\), so any \(x \le 0\) is a counterexample. A common error is to try only positive values, which all agree with the statement; another is to treat \((x + 3)^{2}\) as \(x^{2} + 9\).

Mark scheme
  1. 1 mark

    M1 for a value of \(x \le 0\) substituted correctly into both sides, eg \(x = -1\): \((-1 + 3)^2 = 4\) and \((-1)^2 + 9 = 10\)

    Any \(x \le 0\) works, eg \(x = 0\): both sides are 9; \(x = -2\): 1 and 13; \(x = -3\): 0 and 18. A positive value of \(x\) makes the statement true for that value and scores 0. Alternative method: M1 for \((x + 3)^2 = x^2 + 6x + 9\), or \((x + 3)^2 - (x^2 + 9) = 6x\).

  2. 1 mark

    A1 for a correct conclusion, eg '4 is not greater than 10, so the statement is false'

    For \(x = 0\) the conclusion must say that the two sides are equal (9 is not greater than 9). Alternative method: A1 for '\(6x \le 0\) when \(x \le 0\), so \((x + 3)^2\) is not greater than \(x^2 + 9\) for these values' oe. This is a 'show that' question: a value with no working (eg just '\(x = -1\)', without both sides evaluated) scores 0, and an answer that only restates that the statement is false scores 0. Several counterexamples are fine, but an incorrect one (eg claiming \(x = 1\) works) is A0.

Question 2

3 marks

\(m\) is 1 more than a multiple of 5
\(n\) is 2 more than a multiple of 5

Prove that \(mn + 3\) is a multiple of 5

Model answer

\(m = 5a + 1\) and \(n = 5b + 2\), where \(a\) and \(b\) are integers.
\(mn = (5a + 1)(5b + 2) = 25ab + 10a + 5b + 2\)
\(mn + 3 = 25ab + 10a + 5b + 5\)
\(= 5(5ab + 2a + b + 1)\)
\(5ab + 2a + b + 1\) is an integer, so \(mn + 3\) is a multiple of 5

Explanation

Write each number in terms of its own multiple of 5, using different letters because \(m\) and \(n\) need not come from the same multiple. After expanding, every term except the constant has a factor of 5, and the constant becomes \(2 + 3 = 5\), so 5 factorises out. A common error is to use the same letter for both numbers, which proves only a special case.

Mark scheme
  1. 1 mark

    B1 for \(m = 5a + 1\) and \(n = 5b + 2\), where \(a\) and \(b\) are integers

    Any letters, but different letters must be used for the two multiples. Using the same letter (eg \(m = 5k + 1\) and \(n = 5k + 2\)) proves the result only when the two multiples are equal: B0, and then at most the M1 can be scored.

  2. 1 mark

    M1 for \((5a + 1)(5b + 2) = 25ab + 10a + 5b + 2\)

    The expansion may be seen in a grid. ft their expressions of the form \(5a + 1\) and \(5b + 2\); for the same letter: \((5k + 1)(5k + 2) = 25k^2 + 15k + 2\) scores M1.

  3. 1 mark

    A1 for \(mn + 3 = 25ab + 10a + 5b + 5 = 5(5ab + 2a + b + 1)\) and the conclusion, eg '\(5ab + 2a + b + 1\) is an integer, so \(mn + 3\) is a multiple of 5'

    Needs the B1 as well as the M1. oe eg '\(25ab\), \(10a\), \(5b\) and 5 are all multiples of 5, so their sum is a multiple of 5'. Numerical examples only (eg \(6 \times 7 + 3 = 45\)) score 0. An answer that only restates the result scores 0; every step must be shown.

Question 3

3 marks

A triangle has sides of length \((2n + 1)\) cm, \((2n^{2} + 2n)\) cm and \((2n^{2} + 2n + 1)\) cm, where \(n\) is a positive integer.

Prove that the triangle is right-angled.

Type powers with \(\text{\textasciicircum}\), for example \(\text{x\textasciicircum 2}\).

Model answer

\((2n + 1)^{2} = 4n^{2} + 4n + 1\)
\((2n^{2} + 2n)^{2} = 4n^{4} + 8n^{3} + 4n^{2}\)
\((2n + 1)^{2} + (2n^{2} + 2n)^{2} = 4n^{4} + 8n^{3} + 8n^{2} + 4n + 1\)
\((2n^{2} + 2n + 1)^{2} = 4n^{4} + 4n^{3} + 2n^{2} + 4n^{3} + 4n^{2} + 2n + 2n^{2} + 2n + 1 = 4n^{4} + 8n^{3} + 8n^{2} + 4n + 1\)
So \((2n + 1)^{2} + (2n^{2} + 2n)^{2} = (2n^{2} + 2n + 1)^{2}\)
The sides satisfy Pythagoras' theorem, so the triangle is right-angled (the right angle is opposite the side of length \((2n^{2} + 2n + 1)\) cm).

Explanation

A triangle whose sides satisfy \(a^{2} + b^{2} = c^{2}\) is right-angled, so show that the squares of the two shorter sides add up to the square of the longest. A quicker route is the difference of two squares: \((2n^{2} + 2n + 1)^{2} - (2n^{2} + 2n)^{2} = 1 \times (4n^{2} + 4n + 1) = (2n + 1)^{2}\). A common error is to check one value of \(n\), such as the 3, 4, 5 triangle, which does not prove the result for every \(n\); another is to expand \((2n^{2} + 2n + 1)^{2}\) as \(4n^{4} + 4n^{2} + 1\).

Mark scheme
  1. 1 mark

    M1 for a correct expansion of one of \((2n + 1)^2 = 4n^2 + 4n + 1\), \((2n^2 + 2n)^2 = 4n^4 + 8n^3 + 4n^2\) or \((2n^2 + 2n + 1)^2 = 4n^4 + 8n^3 + 8n^2 + 4n + 1\)

    May be seen unsimplified or in a grid, eg \((2n^2 + 2n + 1)^2 = 4n^4 + 4n^3 + 2n^2 + 4n^3 + 4n^2 + 2n + 2n^2 + 2n + 1\). Alternative method (difference of two squares): M1 for \((2n^2 + 2n + 1)^2 - (2n^2 + 2n)^2 = (2n^2 + 2n + 1 + 2n^2 + 2n)(2n^2 + 2n + 1 - 2n^2 - 2n)\) oe; M1dep for \(= (4n^2 + 4n + 1) \times 1 = (2n + 1)^2\); A1 as below.

  2. 1 mark

    M1dep for \((2n + 1)^2 + (2n^2 + 2n)^2 = 4n^4 + 8n^3 + 8n^2 + 4n + 1\) and \((2n^2 + 2n + 1)^2 = 4n^4 + 8n^3 + 8n^2 + 4n + 1\)

    All three squares expanded correctly and the two shorter sides' squares added. oe eg \((2n^2 + 2n + 1)^2 - (2n^2 + 2n)^2 = 4n^2 + 4n + 1\) from correct expansions.

  3. 1 mark

    A1 for \((2n + 1)^2 + (2n^2 + 2n)^2 = (2n^2 + 2n + 1)^2\) and the conclusion, eg 'the sides satisfy Pythagoras' theorem, so the triangle is right-angled'

    oe conclusion that refers to Pythagoras or to \(a^2 + b^2 = c^2\). The longest side need not be identified. Checking particular values of \(n\) (eg 3, 4, 5 when \(n = 1\); 5, 12, 13 when \(n = 2\)) scores 0. Starting from \((2n + 1)^2 + (2n^2 + 2n)^2 = (2n^2 + 2n + 1)^2\) as an equation and working to \(0 = 0\) is at most M2A0. An answer that only restates the result scores 0; every step must be shown.

Question 4

4 marks

\(n\) is a positive integer.

Prove that \(4^{n} - 1\) is a multiple of 3

Type powers with \(\text{\textasciicircum}\), for example \(\text{x\textasciicircum 2}\).

Model answer

\(4^{n} - 1 = (2^{2})^{n} - 1 = (2^{n})^{2} - 1\)
\(= (2^{n} - 1)(2^{n} + 1)\)
\(2^{n} - 1\), \(2^{n}\) and \(2^{n} + 1\) are three consecutive integers, so one of them is a multiple of 3
\(2^{n}\) is not a multiple of 3, because its only prime factor is 2
So \(2^{n} - 1\) or \(2^{n} + 1\) is a multiple of 3
So \((2^{n} - 1)(2^{n} + 1) = 4^{n} - 1\) is a multiple of 3

Explanation

Writing \(4^{n}\) as \((2^{n})^{2}\) turns \(4^{n} - 1\) into a difference of two squares. The factors \(2^{n} - 1\) and \(2^{n} + 1\) sit either side of \(2^{n}\); one of any three consecutive integers is a multiple of 3, and it cannot be \(2^{n}\), so it must be one of the factors. A common error is to check a few values of \(n\), which does not prove the result for every \(n\).

Mark scheme
  1. 1 mark

    M1 for \(4^n = (2^n)^2\) or \(2^{2n}\) oe

    oe eg \(4^n - 1 = (2^n)^2 - 1^2\). See the end of these comments for other methods.

  2. 1 mark

    M1dep for \(4^n - 1 = (2^n - 1)(2^n + 1)\)

    Difference of two squares.

  3. 1 mark

    M1dep for '\(2^n - 1\), \(2^n\) and \(2^n + 1\) are three consecutive integers, so one of them is a multiple of 3' oe

    oe eg 'of any three consecutive integers, exactly one is divisible by 3'.

  4. 1 mark

    A1 for '\(2^n\) is not a multiple of 3 (its only prime factor is 2), so \(2^n - 1\) or \(2^n + 1\) is a multiple of 3, so \(4^n - 1\) is a multiple of 3'

    Both reasons are needed: that one of three consecutive integers is a multiple of 3, and that it is not \(2^n\). Other complete methods score 4 marks, eg: (i) \(4^n - 1 = (4 - 1)(4^{n - 1} + 4^{n - 2} + \ldots + 4 + 1)\), and the second bracket is a sum of integers, so \(4^n - 1 = 3 \times\) an integer; (ii) writing \(4^n = (3 + 1)^n\) and explaining that every term of the expansion except \(1^n = 1\) contains a factor of 3, so \(4^n = 3k + 1\); (iii) a correct proof by induction. A correct start to one of these, with no complete argument, scores M1 only. Checking values of \(n\) (eg \(4^3 - 1 = 63 = 3 \times 21\)) scores 0. An answer that only restates the result scores 0; every step must be shown.

Ready to try the rest? Every answer you write is marked against the mark scheme, so you can see exactly where the marks are.

Study Helper Hints first, answers after you try

Stuck on this one? Ask for a hint and I’ll point you in the right direction, without giving the answer away. Once you’ve checked your answer, I’ll show you how the marks are awarded.