Algebraic Proof - Worksheets, Questions and Revision
58 original exam-style questions - 14 pages of questions with a full mark scheme - free printable PDF.
Algebraic Proof revision guideMore GCSE Further Maths practiceMock exams
This topic is chapter 10 of Level 2 Further Maths (AQA 8365) Topic Workbook 1 and chapter 10 of Level 2 Further Maths (AQA 8365) 10-Minute Tests.
2.7 Algebraic Proof
"n2 - n = n(n-1). Since n-1 is even, n(n-1) must be even, so n(n-1)+1 is odd."
Question 1
- writes the sum of three consecutive integers as n + (n+1) + (n+2)M1
- simplifies correctly to 3n + 3M1
- factorises to 3(n+1) and states this is a multiple of 3 for every integer nA1
- Answer: n + (n+1) + (n+2) = 3(n+1), a multiple of 3
Question 2
- cso: writes the sum as n+(n+1)+(n+2)+(n+3)+(n+4) = 5n+10 = 5(n+2), a multiple of 5B1
- Answer: n+(n+1)+(n+2)+(n+3)+(n+4) = 5(n+2), a multiple of 5
Question 3
- factorises n2 - n as n(n-1)M1
- identifies n and n-1 as two consecutive integers, one of which must be evenM1
- correct conclusion: since one of n, n-1 is even, their product n(n-1) is always evenA1
- Answer: n2 - n = n(n-1), always even
Question 4
- writes the product (2n+1)(2m+1) and expands correctly to 4nm + 2n + 2m + 1M1
- factorises 4nm + 2n + 2m as 2(2nm + n + m)M1
- correct conclusion that 2(2nm+n+m) + 1 is of the form 2k + 1, so it is always oddA1
- Answer: (2n+1)(2m+1) = 2(2nm+n+m) + 1, always odd
Question 5
- writes three consecutive multiples of 4 as 4n, 4n+4, 4n+8 and sums to 12n + 12M1
- factorises correctly to 12(n+1)A1
- correct conclusion that 12(n+1) is always a multiple of 12, since n+1 is an integerA1
- Answer: 4n + (4n+4) + (4n+8) = 12(n+1), a multiple of 12
Question 6
- cso: factorises n2+3n = n(n+3) and correctly reasons that if n is even the product is even, and if n is odd then n+3 is even so the product is even, so n(n+3) is always evenB1
- Answer: n2 + 3n = n(n+3), always even
Question 7
- cso: ab = (2n)(2m) = 4nm, a multiple of 4 since n, m are integersB1
- Answer: ab = 4nm, a multiple of 4
Question 8
- cso: (2n+1)+(2m+1) = 2n+2m+2 = 2(n+m+1), always evenB1
- Answer: (2n+1) + (2m+1) = 2(n+m+1), always even
Question 9
- completes the square correctly, x2 + 2x + 5 = (x+1)2 - 1 + 5M1
- cso: simplifies to (x+1)2 + 4, and since (x+1)2 ≥ 0 for all real x, (x+1)2+4 ≥ 4 > 0, so x2+2x+5 > 0 alwaysA1
- Answer: x2 + 2x + 5 = (x+1)2 + 4 > 0 for all real x
Question 10
- cso: 5n + (5n+5) + (5n+10) = 15n + 15 = 15(n+1), a multiple of 15B1
- Answer: 5n + (5n+5) + (5n+10) = 15(n+1), a multiple of 15
Question 11
- factorises the numerator, x2 - 9 = (x-3)(x+3)M1
- factorises the denominator, x2 - x - 6 = (x-3)(x+2)A1
- cancels the common factor (x-3) correctly to give (x+3)/(x+2), stating x is not equal to 3 and x is not equal to -2A1
- Answer: (x+3)/(x+2), for x not equal to 3, -2
Question 12
- factorises n3 - n as n(n-1)(n+1)M1
- identifies n-1, n, n+1 as three consecutive integersM1
- valid reasoning that among any three consecutive integers, at least one is divisible by 3 and at least one is even (divisible by 2)A1
- correct conclusion that the product is divisible by both 2 and 3, hence divisible by 6A1
- Answer: n3 - n = (n-1)n(n+1), always divisible by 6
Question 13
- n even: (n + 4) is even, so the product is evenM1
- n odd: (n + 7) is even, so the product is evenM1
- both cases covered, so the product is always evenA1
- Answer: always even
Question 14
- sum = n + (n + 1) + ... + (n + 12) written downM1
- collects to 13n + 78M1
- 13(n + 6)A1
- conclusion: 13 is a factor, so the sum is a multiple of 13C1
- Answer: 13(n + 6)
Question 15
- expands: n2 + 14n + 49M1
- recognises 72 = 49 and 2 x 7 = 14M1
- (n + 7)2A1
- (n + 7)2 is the square of the integer n + 7C1
- Answer: (n + 7)2
Question 16
- expands the first product (3 terms correct)M1
- expands n(...) and subtractsM1
- n2 and n terms cancel; result -64A1
- states the value is independent of nC1
- Answer: -64
Question 17
- expands both brackets: n2 + 10n + 25 and n2 + 6n + 9M1
- n2 terms cancel: 4n + 16M1
- 2(2n + 8) or equivalent factorised formA1
- conclusion linking the factorised form to the claimC1
- Answer: 2(2n + 8)
Question 18
- n even: (n + 2) is even, so the product is evenM1
- n odd: (n + 9) is even, so the product is evenM1
- both cases covered, so the product is always evenA1
- Answer: always even
Question 19
- sum = n + (n + 1) + ... + (n + 2) written downM1
- collects to 3n + 3M1
- 3(n + 1)A1
- conclusion: 3 is a factor, so the sum is a multiple of 3C1
- Answer: 3(n + 1)
Question 20
- (5n)2 + (5(n + 1))2M1
- 25n2 + 25(n2 + 2n + 1) or equivalentM1
- 52(2n2 + 2n + 1)A1
- 25 is a factor of every term, so the sum is a multiple of 25C1
- Answer: 52(2n2 + 2n + 1)
Question 21
- expands: n2 + 2n + 1M1
- recognises 12 = 1 and 2 x 1 = 2M1
- (n + 1)2A1
- (n + 1)2 is the square of the integer n + 1C1
- Answer: (n + 1)2
Question 22
- expands the first product (3 terms correct)M1
- expands n(...) and subtractsM1
- n2 and n terms cancel; result -36A1
- states the value is independent of nC1
- Answer: -36
Question 23
- expands both brackets: n2 + 16n + 64 and n2 + 2n + 1M1
- n2 terms cancel: 14n + 63M1
- 7(2n + 9) or equivalent factorised formA1
- conclusion linking the factorised form to the claimC1
- Answer: 7(2n + 9)
Question 24
- (4(n + 1))2 - (4n)2M1
- 16(n2 + 2n + 1) - 16n2 or equivalentM1
- 42(2n + 1)A1
- 2n + 1 is odd, so the result is an odd multiple of 16C1
- Answer: 42(2n + 1)
Question 25
- sum = n + (n + 1) + ... + (n + 10) written downM1
- collects to 11n + 55M1
- 11(n + 5)A1
- conclusion: 11 is a factor, so the sum is a multiple of 11C1
- Answer: 11(n + 5)
Question 26
- expands: n2 + 6n + 9M1
- recognises 32 = 9 and 2 x 3 = 6M1
- (n + 3)2A1
- (n + 3)2 is the square of the integer n + 3C1
- Answer: (n + 3)2
Question 27
- expands: 4n2 + 20n + 25M1
- subtracts 25: 4n2 + 20nM1
- 4n(n + 5)A1
- n and n + 5 differ by an odd number so one is even; hence 4 x even is a multiple of 8C1
- Answer: 4n(n + 5)
Question 28
- expands both brackets: n2 + 14n + 49 and n2 + 6n + 9M1
- n2 terms cancel: 8n + 40M1
- 4(2n + 10) or equivalent factorised formA1
- conclusion linking the factorised form to the claimC1
- Answer: 4(2n + 10)
Question 29
- sum = n + (n + 1) + ... + (n + 6) written downM1
- collects to 7n + 21M1
- 7(n + 3)A1
- conclusion: 7 is a factor, so the sum is a multiple of 7C1
- Answer: 7(n + 3)
Question 30
- expands: n2 + 4n + 4M1
- recognises 22 = 4 and 2 x 2 = 4M1
- (n + 2)2A1
- (n + 2)2 is the square of the integer n + 2C1
- Answer: (n + 2)2
Question 31
- n even: (n + 12) is even, so the product is evenM1
- n odd: (n + 9) is even, so the product is evenM1
- both cases covered, so the product is always evenA1
- Answer: always even
Question 32
- expands the first product (3 terms correct)M1
- expands n(...) and subtractsM1
- n2 and n terms cancel; result -36A1
- states the value is independent of nC1
- Answer: -36
Question 33
- expands: n2 + 16n + 64M1
- recognises 82 = 64 and 2 x 8 = 16M1
- (n + 8)2A1
- (n + 8)2 is the square of the integer n + 8C1
- Answer: (n + 8)2
Question 34
- (12(n + 1))2 - (12n)2M1
- 144(n2 + 2n + 1) - 144n2 or equivalentM1
- 122(2n + 1)A1
- 2n + 1 is odd, so the result is an odd multiple of 144C1
- Answer: 122(2n + 1)
Question 35
- n even: (n + 6) is even, so the product is evenM1
- n odd: (n + 9) is even, so the product is evenM1
- both cases covered, so the product is always evenA1
- Answer: always even
Question 36
- expands the first product (3 terms correct)M1
- expands n(...) and subtractsM1
- n2 and n terms cancel; result 36A1
- states the value is independent of nC1
- Answer: 36
Question 37
- expands: 4n2 + 36n + 81M1
- subtracts 81: 4n2 + 36nM1
- 4n(n + 9)A1
- n and n + 9 differ by an odd number so one is even; hence 4 x even is a multiple of 8C1
- Answer: 4n(n + 9)
Question 38
- sum = n + (n + 1) + ... + (n + 8) written downM1
- collects to 9n + 36M1
- 9(n + 4)A1
- conclusion: 9 is a factor, so the sum is a multiple of 9C1
- Answer: 9(n + 4)
Question 39
- n even: (n + 2) is even, so the product is evenM1
- n odd: (n + 1) is even, so the product is evenM1
- both cases covered, so the product is always evenA1
- Answer: always even
Question 40
- (8(n + 1))2 - (8n)2M1
- 64(n2 + 2n + 1) - 64n2 or equivalentM1
- 82(2n + 1)A1
- 2n + 1 is odd, so the result is an odd multiple of 64C1
- Answer: 82(2n + 1)
Question 41
- (8n)2 + (8(n + 1))2M1
- 64n2 + 64(n2 + 2n + 1) or equivalentM1
- 82(2n2 + 2n + 1)A1
- 64 is a factor of every term, so the sum is a multiple of 64C1
- Answer: 82(2n2 + 2n + 1)
Question 42
- (6(n + 1))2 - (6n)2M1
- 36(n2 + 2n + 1) - 36n2 or equivalentM1
- 62(2n + 1)A1
- 2n + 1 is odd, so the result is an odd multiple of 36C1
- Answer: 62(2n + 1)
Question 43
- uses difference of two squares: (2n+1)2 - (2n-1)2 = [(2n+1)-(2n-1)][(2n+1)+(2n-1)]M1
- simplifies correctly to (2)(4n) = 8nA1
- correct conclusion that 8n is always a multiple of 8 for integer nA1
- Answer: (2n+1)2 - (2n-1)2 = 8n, a multiple of 8
Question 44
- multiplies both sides by 100 (as two digits repeat), giving 100x = 45.454545...M1
- subtracts x = 0.454545... from 100x to eliminate the recurring part, giving 99x = 45M1
- solves and simplifies fully to x = 45/99 = 5/11A1
- Answer: x = 5/11
Question 45
- factorises the numerator, x2 - 16 = (x-4)(x+4), and the denominator, x2 - x - 12 = (x-4)(x+3)M1
- cso: cancels the common factor (x-4) correctly to give (x+4)/(x+3), stating x is not equal to 4 and x is not equal to -3A1
- Answer: (x+4)/(x+3), for x not equal to 4, -3
Question 46
- identifies the error: n-1 is not always even (e.g. if n is even, such as n=4, then n-1=3 is odd), so the claim 'n-1 is even' is a false general statementB1
- gives a correct justification: n and n-1 are consecutive integers, so exactly one of them must always be even, meaning their product n(n-1) is always even regardless of which one is evenB1
- Answer: The claim that n-1 is always even is false; the correct reasoning is that one of n, n-1 (consecutive integers) is always even
Question 47
- factorises n3+n as n(n2+1)M1
- cso: valid reasoning that if n is even the product is even, and if n is odd then n2 is odd so n2+1 is even, making the product even; so n3+n is always evenA1
- Answer: n3 + n = n(n2+1), always even
Question 48
- completes the square correctly, x2 - 8x + 20 = (x-4)2 - 16 + 20M1
- simplifies to (x-4)2 + 4A1
- cso: since (x-4)2 ≥ 0 for all real x, (x-4)2 + 4 ≥ 4 > 0, so x2-8x+20 > 0 for all real xA1
- Answer: x2 - 8x + 20 = (x-4)2 + 4 > 0 for all real x
Question 49
- discriminant = (-4)2 - 4(1)(8) (= 16-32)M1
- = -16A1
- cso: since -16 < 0 the equation has no real rootsA1
- Answer: Discriminant = -16 < 0, so no real roots
Question 50
- uses difference of two squares: (2n+3)2 - (2n-1)2 = [(2n+3)-(2n-1)][(2n+3)+(2n-1)]M1
- cso: simplifies correctly to (4)(4n+2) = 16n+8 = 8(2n+1), a multiple of 8A1
- Answer: (2n+3)2 - (2n-1)2 = 8(2n+1), a multiple of 8
Question 51
- selects a suitable value of n to test, e.g. n = 41M1
- evaluates n2 + n + 41 correctly for the chosen n, writing it in a factorisable form, e.g. n2+n+41 = n(n+1)+41, so at n=41: 41(42)+41 = 41(43)M1
- correct conclusion that 41 x 43 = 1763 has factors other than 1 and itself, so it is not prime, disproving the claim by counter-exampleA1
- Answer: False: at n=41, n2+n+41 = 41 x 43 = 1763, which is not prime
Question 52
- completes the square correctly, a(x + b/(2a))2 + c - b2/(4a) = 0M1
- rearranges to isolate the squared term, a(x + b/(2a))2 = (b2 - 4ac)/(4a)A1
- valid reasoning that the left-hand side is always ≥ 0 (since a > 0), while the right-hand side is negative when b2 < 4ac (as 4a > 0)A1
- correct conclusion: a non-negative quantity cannot equal a negative quantity, so no real value of x satisfies the equation, i.e. no real roots existA1
- Answer: No real roots exist when b2 < 4ac and a > 0
Question 53
- expands (m2-n2)2 correctly to m4 - 2m2n2 + n4M1
- expands (2mn)2 correctly to 4m2n2 and adds to the previous expansionM1
- simplifies the sum correctly to m4 + 2m2n2 + n4A1
- recognises this factorises as (m2+n2)2, matching the right-hand side, so the identity holds for all m > n > 0A1
- Answer: (m2-n2)2 + (2mn)2 = (m2+n2)2 for all m > n > 0
Question 54
- writes the sum of four consecutive integers as n+(n+1)+(n+2)+(n+3), simplifying to 4n + 6M1
- factorises correctly to 2(2n+3)A1
- valid reasoning that 2n + 3 is always odd (2n is even, plus the odd number 3)A1
- correct conclusion that 2 x (an odd number) is always even, but is never divisible by 4, since (2n+3) is never evenA1
- Answer: Sum = 2(2n+3), always even but never a multiple of 4
Question 55
- assumes, for contradiction, that √2 is rational, so √2 = p/q where p and q are integers with no common factor (in lowest terms), q not equal to 0B1
- squares both sides to get p2 = 2q2, and deduces that since p2 is even, p itself must be evenB1
- substitutes p = 2k into p2 = 2q2 to obtain 4k2 = 2q2, so q2 = 2k2, and deduces q must also be evenB1
- states that p and q being both even contradicts the assumption that p/q was in lowest terms (no common factor)B1
- correct final conclusion: the contradiction means the original assumption was false, so √2 is irrationalB1
- Answer: √2 is irrational (proof by contradiction)
Question 56
- Level 1 Attempts to expand n^2 = (10k+r)^2, or lists some values of r^2, but with limited progress and no valid general conclusion.1-2
- Level 2 Expands (10k+r)^2 correctly and shows the units digit of n^2 depends only on r^2. Checks several but not all values of r from 0 to 9, or makes a minor error in the case check, but reaches a broadly correct partial conclusion.3-4
- Level 3 Fully correct and complete argument: expands (10k+r)^2 to show the units digit of n^2 depends only on the units digit of r^2, systematically checks all ten values r = 0 to 9, correctly lists the resulting units digits (0, 1, 4, 9, 6, 5, 6, 9, 4, 1), and concludes clearly that 2, 3, 7 and 8 never appear, so a square number can never end in these digits.5-6
- Indicative content:
- n^2 = (10k+r)^2 = 100k^2 + 20kr + r^2 = 10(10k^2 + 2kr) + r^2
- The units digit of n^2 is therefore determined entirely by the units digit of r^2 (since 10(10k^2+2kr) contributes only to tens and higher place values)
- Systematically evaluating r^2 for r = 0,1,2,...,9 gives: 0, 1, 4, 9, 16, 25, 36, 49, 64, 81
- Taking units digits of these values gives: 0, 1, 4, 9, 6, 5, 6, 9, 4, 1
- None of these units digits is 2, 3, 7 or 8
- Since every integer n has a units digit r in {0,...,9}, and all cases have been checked, no square number can ever end in 2, 3, 7 or 8
Question 57
- assumes, for contradiction, that a largest even integer exists, and calls it EB1
- considers E + 2, and states that E + 2 is even, since E is even and 2 is even, so their sum is evenB1
- shows that E + 2 > E, since adding a positive number always gives a larger numberB1
- cso: correct conclusion: E + 2 is an even integer larger than E, contradicting the assumption that E was the largest even integer, so no largest even integer existsB1
- Answer: No largest even integer exists (proof by contradiction)
Question 58
- assumes, for contradiction, that √3 is rational, so √3 = p/q where p and q are integers with no common factor (in lowest terms), q not equal to 0; squares both sides to get p2 = 3q2, and deduces that since p2 is divisible by 3, p itself must be divisible by 3B1
- substitutes p = 3k into p2 = 3q2 to obtain 9k2 = 3q2, so q2 = 3k2, and deduces q must also be divisible by 3B1
- states that p and q being both divisible by 3 contradicts the assumption that p/q was in lowest terms (no common factor)B1
- cso: correct final conclusion: the contradiction means the original assumption was false, so √3 is irrationalB1
- Answer: √3 is irrational (proof by contradiction)
Mark your answers
Check answers without an account. Some answers can be checked automatically; use the mark scheme to mark the rest.