Pure: Proof - Worksheets, Questions and Revision
34 original exam-style questions - 7 pages of questions with a full mark scheme - free printable PDF.
Pure: Proof revision guideWrite-in editionMore A Level Maths practiceMock exams
This topic is chapter 1 of A Level Maths Pure Topic Workbook 1 and chapter 1 of A Level Maths 10-Minute Tests 1.
1.1 Pure: Proof
Question 1
- even, 78 = 2(39), n = 39B1
- Answer: Even; n = 39
Question 2
- n(n - 1) caoB1
- Answer: n(n - 1)
Question 3
- 4k2 - 1 caoB1
- Answer: 4k2 - 1
Question 4
- 2n, with n = 66B1
- Answer: 2n, n = 66
Question 5
- (a) n=1: 13+1=2, evenB1
- (a) n=2: 23+2=10, evenB1
- (a) n=3: 33+3=30, evenB1
- (a) n=4: 43+4=68, even, and all four cases 1≤n≤4 have been checked, caoB1
- (a) Answer: n=1,2,3,4 give 2, 10, 30, 68, all even
- (b) case n=2k: substitutes to get n3+n=8k3+2kM1
- (b) writes 8k3+2k=2(4k3+k), a multiple of 2, hence evenA1
- (b) case n=2k+1: substitutes and factorises n3+n=(2k+1)[(2k+1)2+1]=(2k+1)(4k2+4k+2)M1
- (b) writes this as 2(2k+1)(2k2+2k+1), a multiple of 2, hence even; since every integer is even or odd, this proves the result for all positive integers, csoA1
- (b) Answer: Proof: n3+n is even for all positive integers n
- (c) states that part (a) only checks a finite number of cases (n=1 to 4), but the claim is about all positive integers, an infinite setB1
- (c) states that a proof by exhaustion must check every case in the set, which is impossible for an infinite set, so a general argument (as in part (b)) is needed insteadB1
- (c) Answer: Checking 4 cases cannot establish a result for infinitely many integers
Question 6
- (a) chooses a valid value of x with 0<x<1, e.g. x=0.5, oeB1
- (a) shows x2<x for this value, e.g. 0.52=0.25<0.5, so the statement is false, caoA1
- (a) Answer: x=0.5 gives 0.25 < 0.5, so the statement is false
- (b) states n=2B1
- (b) justifies that 2 is prime and even, contradicting the statement, caoA1
- (b) Answer: n=2 is prime and even, so the statement is false
- (c) chooses valid values with a and b both non-zero, e.g. a=1, b=1, oeB1
- (c) shows (1+1)2=4 but 12+12=2, and 4 is not equal to 2, so the statement is false, caoA1
- (c) Answer: a=1, b=1 gives 4 not equal to 2, so the statement is false
- (d) chooses a valid value of θ with θ>45 in the given range, e.g. θ=350, oeB1
- (d) shows sin(350) is awrt -0.17 and cos(350) is awrt 0.98, so sin(θ)≤cos(θ) holds, yet θ=350 is not ≤45, so the statement is false, caoA1
- (d) Answer: θ=350 gives sin(θ) awrt -0.17 ≤ cos(θ) awrt 0.98, but θ>45, so the statement is false
Question 7
- writes the two even integers as 2a and 2b, for integers a and b, and forms the sum 2a + 2bM1
- writes the sum as 2(a + b), a multiple of 2, hence even, csoA1
- Answer: Proof: 2a + 2b = 2(a + b), which is even
Question 8
- writes the two odd integers as 2p + 1 and 2q + 1, and expands (2p + 1)(2q + 1) = 4pq + 2p + 2q + 1M1
- writes this as 2(2pq + p + q) + 1, a multiple of 2 plus 1, hence odd, csoA1
- Answer: Proof: (2p+1)(2q+1) = 2(2pq+p+q)+1, which is odd
Question 9
- n = 2 (gives 5, which is odd), or any other even n, oeB1
- Answer: n = 2, since 22 + 1 = 5 is odd
Question 10
- (a) considers the case n=2k (n even) and writes n(n+1)=2k(2k+1), a multiple of 2M1
- (a) considers the case n=2k+1 (n odd) and writes n(n+1)=(2k+1)(2k+2)=2(2k+1)(k+1), a multiple of 2A1
- (a) since every integer n is even or odd, and the product is a multiple of 2 in both cases, n(n+1) is always even, csoA1
- (a) Answer: Proof: n(n+1) is always even
- (b) recognises n2+n=n(n+1), oeM1
- (b) uses the result from part (a) that n(n+1) is even, ftA1
- (b) states that even + 1 is odd, so n2+n+1 is always odd, csoA1
- (b) Answer: Proof: n2+n+1 = n(n+1)+1 = even+1 = odd
Question 11
- factorises n2 - n = n(n - 1)M1
- states that n and n-1 are consecutive integers, so exactly one of them is even, hence n(n-1) is always evenA1
- cso: since n(n-1) is even, n(n-1)+3 = even + odd = odd for every integer nA1
- Answer: Proof: n2 - n + 3 = n(n-1) + 3 = even + 3, which is odd
Question 12
- (a) correctly evaluates n=1: 4, n=2: 8, n=3: 14B1
- (a) states that all three values are evenB1
- (a) Answer: n=1: 4, n=2: 8, n=3: 14, all even
- (b) recognises n2 + n = n(n+1), the product of two consecutive integers, so n(n+1) is always evenM1
- (b) cso: n2+n+2 = n(n+1) + 2 = even + even = even for every positive integer nA1
- (b) Answer: Proof: n2+n+2 = n(n+1)+2, and n(n+1) is always even, so the sum is always even
Question 13
- (a) begins to complete the square: (x + p)2 with p = b/2M1
- (a) a = 1, p = 1A1
- (a) q = 8A1
- (a) Answer: f(x) = (x + 1)2 + 8
- (b) states that a squared term is non-negativeM1
- (b) so f(x) ≥ 8 > 0 (cso)A1
- (b) Answer: minimum value 8 > 0
- (c) (-1, 8)B1
- (c) the minimum value 8 is above the x-axis, so there are no real rootsB1
- (c) Answer: (-1, 8)
Question 14
- (a) assumes there are integers x and y with 4x + 10y = 5M1
- (a) notes the left side is even, since 4x + 10y = 2(2x + 5y)M1
- (a) but 5 is odd, a contradictionA1
- (a) so no such integers exist (cso)A1
- (a) Answer: no integer solutions
- (b) systematic trial or use of the Euclidean algorithmM1
- (b) a valid pair, for example x = -6, y = 3A1
- (b) Answer: x = -6, y = 3
Question 15
- (a) chooses a negative value for y, or negative values for bothM1
- (a) for example x = -3, y = -4: x > y since -3 > -4M1
- (a) x2 = 9 and y2 = 16, and 9 < 16, so the claim is falseA1
- (a) Answer: x = -3, y = -4: x > y but x2 = 9 < y2 = 16
- (b) x > y > 0 (or both non-negative)B1
- (b) since squaring is an increasing function for positive numbers (x2 - y2 = (x - y)(x + y) > 0)B1
- (b) Answer: true when x and y are both positive (x + y > 0)
Question 16
- (a) takes out the factor 3M1
- (a) a = 3, p = 5A1
- (a) q = 7A1
- (a) Answer: f(x) = 3(x + 5)2 + 7
- (b) states that a squared term is non-negativeM1
- (b) so f(x) ≥ 7 > 0 (cso)A1
- (b) Answer: minimum value 7 > 0
- (c) (-5, 7)B1
- (c) the minimum value 7 is above the x-axis, so there are no real rootsB1
- (c) Answer: (-5, 7)
Question 17
- (a) assumes there are integers x and y with 2x + 8y = 11M1
- (a) notes the left side is even, since 2x + 8y = 2(x + 4y)M1
- (a) but 11 is odd, a contradictionA1
- (a) so no such integers exist (cso)A1
- (a) Answer: no integer solutions
- (b) systematic trial or use of the Euclidean algorithmM1
- (b) a valid pair, for example x = 3, y = 0A1
- (b) Answer: x = 3, y = 0
Question 18
- (a) pairs the factors: n(n + 3) = n2 + 3n and (n + 1)(n + 2) = n2 + 3n + 2M1
- (a) lets w = n2 + 3n and writes the expression as w(w + 2) + 1M1
- (a) w2 + 2w + 1 = (w + 1)2A1
- (a) states (n2 + 3n + 1)2 with n2 + 3n + 1 an integer (cso)A1
- (a) Answer: n(n+1)(n+2)(n+3) + 1 = (n2 + 3n + 1)2
- (b) identifies n = 5M1
- (b) 412A1
- (b) Answer: 412
Question 19
- (a) tries n = 11 (or other values until a composite appears)M1
- (a) 5(11) + 11 = 66A1
- (a) 66 = 11 x 6, which is not prime, so the claim is falseA1
- (a) Answer: n = 11 gives 66 = 11 x 6
- (b) writes n = 11mM1
- (b) 5(11m) + 11 = 11(5m + 1)A1
- (b) which is a multiple of 11 (cso)A1
- (b) Answer: 11(5m + 1)
Question 20
- (a) tries n = 13 (or other values until a composite appears)M1
- (a) 4(13) + 13 = 65A1
- (a) 65 = 13 x 5, which is not prime, so the claim is falseA1
- (a) Answer: n = 13 gives 65 = 13 x 5
- (b) writes n = 13mM1
- (b) 4(13m) + 13 = 13(4m + 1)A1
- (b) which is a multiple of 13 (cso)A1
- (b) Answer: 13(4m + 1)
Question 21
- (a) begins to complete the square: (x + p)2 with p = b/2M1
- (a) a = 1, p = -5A1
- (a) q = 5A1
- (a) Answer: f(x) = (x - 5)2 + 5
- (b) states that a squared term is non-negativeM1
- (b) so f(x) ≥ 5 > 0 (cso)A1
- (b) Answer: minimum value 5 > 0
- (c) the minimum value 5 is above the x-axis, so there are no real rootsB1
- (c) Answer: (5, 5)
Question 22
- (a) assumes √5 = a/b where a and b are integers with no common factorM1
- (a) squares to obtain a2 = 5b2, so a2 is a multiple of 5M1
- (a) deduces that a is a multiple of 5, a = 5c, and substitutes to obtain 5b2 = 25c2, so b2 = 5c2A1
- (a) hence b is also a multiple of 5, contradicting that a and b have no common factor, so √5 is irrational (cso)A1
- (a) Answer: √5 is irrational
- (b) assumes 5 + √5 = r with r rationalM1
- (b) then √5 = r - 5 is rational, contradicting part (a), so 5 + √5 is irrationalA1
- (b) Answer: 5 + √5 is irrational
Question 23
- (a) lets the integers be n and n + 1 and forms n2 + (n + 1)2M1
- (a) expands and simplifies to 2n2 + 2n + 1M1
- (a) writes this as 2(n2 + n) + 1, which is 2 x (an integer) + 1A1
- (a) concludes that it is odd for every integer n (cso)A1
- (a) Answer: n2 + (n+1)2 = 2(n2 + n) + 1, which is odd
- (b) evaluates 52 + 62 = 25 + 36M1
- (b) 61, which is odd (2 x 30 + 1)A1
- (b) Answer: 61 is odd
Question 24
- (a) pairs the factors: n(n + 3) = n2 + 3n and (n + 1)(n + 2) = n2 + 3n + 2M1
- (a) lets w = n2 + 3n and writes the expression as w(w + 2) + 1M1
- (a) w2 + 2w + 1 = (w + 1)2A1
- (a) states (n2 + 3n + 1)2 with n2 + 3n + 1 an integer (cso)A1
- (a) Answer: n(n+1)(n+2)(n+3) + 1 = (n2 + 3n + 1)2
- (b) identifies n = 2M1
- (b) 112A1
- (b) Answer: 112
Question 25
- (a) takes out the factor 2M1
- (a) a = 2, p = -1A1
- (a) q = 1A1
- (a) Answer: f(x) = 2(x - 1)2 + 1
- (b) states that a squared term is non-negativeM1
- (b) so f(x) ≥ 1 > 0 (cso)A1
- (b) Answer: minimum value 1 > 0
- (c) the minimum value 1 is above the x-axis, so there are no real rootsB1
- (c) Answer: (1, 1)
Question 26
- (a) assumes √3 = a/b where a and b are integers with no common factorM1
- (a) squares to obtain a2 = 3b2, so a2 is a multiple of 3M1
- (a) deduces that a is a multiple of 3, a = 3c, and substitutes to obtain 3b2 = 9c2, so b2 = 3c2A1
- (a) hence b is also a multiple of 3, contradicting that a and b have no common factor, so √3 is irrational (cso)A1
- (a) Answer: √3 is irrational
- (b) assumes 3 + √3 = r with r rationalM1
- (b) then √3 = r - 3 is rational, contradicting part (a), so 3 + √3 is irrationalA1
- (b) Answer: 3 + √3 is irrational
Question 27
- (a) pairs the factors: n(n + 3) = n2 + 3n and (n + 1)(n + 2) = n2 + 3n + 2M1
- (a) lets w = n2 + 3n and writes the expression as w(w + 2) + 1M1
- (a) w2 + 2w + 1 = (w + 1)2A1
- (a) states (n2 + 3n + 1)2 with n2 + 3n + 1 an integer (cso)A1
- (a) Answer: n(n+1)(n+2)(n+3) + 1 = (n2 + 3n + 1)2
- (b) identifies n = 4M1
- (b) 292A1
- (b) Answer: 292
Question 28
- (a) expands sin(θ+60) = sin(θ)cos60 + cos(θ)sin60M1
- (a) expands sin(θ-60) = sin(θ)cos60 - cos(θ)sin60M1
- (a) adds the two expansions so the cos(θ)sin60 terms cancel, leaving 2sin(θ)cos60A1
- (a) substitutes the exact value cos60=1/2 to obtain 2sin(θ)x(1/2)=sin(θ), csoA1
- (a) Answer: Proof: sin(θ+60)+sin(θ-60) = sin(θ)
- (b) uses the identity from part (a) to rewrite the equation as sin(θ)=0.5, ftM1
- (b) θ=30A1
- (b) θ=150, cao, both values and no extras in rangeA1
- (b) Answer: θ = 30 or θ = 150
Question 29
- (a) states (x-y)2 ≥ 0 for all real x and y, since a square cannot be negativeB1
- (a) expands (x-y)2 to x2-2xy+y2M1
- (a) rearranges x2-2xy+y2≥0 to x2+y2≥2xy, csoA1
- (a) Answer: Proof: since (x-y)2 ≥ 0, x2+y2 ≥ 2xy
- (b) substitutes x=a, y=b into part (a) to obtain a2+b2≥2ab, ftM1
- (b) states ab>0 since a>0 and b>0, so dividing both sides of the inequality by ab does not change its directionB1
- (b) divides both sides by ab to obtain a/b+b/a≥2, csoA1
- (b) Answer: Proof: dividing a2+b2≥2ab by ab>0 gives a/b+b/a≥2
Question 30
- (a) differentiates term by termM1
- (a) f'(x)=3x2+12x+15, caoA1
- (a) Answer: f'(x) = 3x2 + 12x + 15
- (b) takes out the factor of 3: f'(x)=3(x2+4x+5)M1
- (b) completes the square: x2+4x+5=(x+2)2+1, giving f'(x)=3[(x+2)2+1]A1
- (b) states (x+2)2≥0 for all real x, so (x+2)2+1≥1, hence f'(x)≥3>0 for all real x, csoA1
- (b) Answer: f'(x) = 3[(x+2)2+1] ≥ 3 > 0 for all real x
- (c) states that since f'(x)>0 for all real x, f is an increasing function for all real values of x, cso, ftB1
- (c) Answer: f(x) is an increasing function for all real x
Question 31
- states (x - 2y)2 ≥ 0 for all real x and y, since a square cannot be negativeB1
- expands (x - 2y)2 to x2 - 4xy + 4y2M1
- rearranges x2 - 4xy + 4y2 ≥ 0 to x2 + 4y2 ≥ 4xy, csoA1
- Answer: Proof: since (x-2y)2 ≥ 0, x2 + 4y2 ≥ 4xy
Question 32
- (a) assumes n is odd, writes n=2k+1 for integer k, and expands n2=(2k+1)2=4k2+4k+1M1
- (a) writes n2=2(2k2+2k)+1, which is odd; since "n odd implies n2 odd" has been shown, its contrapositive "n2 even implies n even" must also be true, csoA1
- (a) Answer: Proof: if n2 is even then n is even
- (b) assumes, for contradiction, that √2 is rational, so √2=p/q where p and q are integers with no common factor (q not equal 0), i.e. p/q is in its lowest termsB1
- (b) squares both sides to obtain p2=2q2M1
- (b) deduces p2 is even, so by part (a), p is even; writes p=2m for integer m, ftA1
- (b) substitutes p=2m into p2=2q2 to get 4m2=2q2, so q2=2m2, dependent on the previous M1dM1
- (b) deduces q2 is even, so by part (a), q is even, ftA1
- (b) states that p and q are both even, so they share a common factor of 2, contradicting the assumption that p/q has no common factorB1
- (b) concludes that the original assumption is false, hence √2 is irrational, csoB1
- (b) Answer: Proof by contradiction: √2 is irrational
Question 33
- (a) takes out a factor of n: n3-n=n(n2-1)M1
- (a) factorises the difference of squares to give n(n-1)(n+1), caoA1
- (a) Answer: n3-n = (n-1)n(n+1)
- (b) states that n and n+1 are consecutive integers, so exactly one of them is even, oeB1
- (b) states that since the product (n-1)n(n+1) contains an even factor, the whole product is divisible by 2, csoB1
- (b) Answer: Divisible by 2 because n and n+1 are consecutive, so one is even
- (c) states that n-1, n and n+1 are three consecutive integers, and among any three consecutive integers exactly one is a multiple of 3, oeB1
- (c) states that since the product contains a multiple of 3, the whole product is divisible by 3, csoB1
- (c) Answer: Divisible by 3 because three consecutive integers include a multiple of 3
- (d) states that 2 and 3 share no common factor other than 1, ft from (b) and (c)M1
- (d) since (n-1)n(n+1) is divisible by both 2 and 3, it is divisible by 2x3=6 for every positive integer n, csoA1
- (d) Answer: Proof complete: n3-n is divisible by 6 for every positive integer n
Question 34
- (a) states, for contradiction, that there are only finitely many primes, p1, p2, ..., pk, and that this is a complete list of every prime, oeB1
- (a) Answer: Assume there is a complete finite list of primes p1, p2, ..., pk
- (b) states that each pi divides the product p1 x p2 x ... x pk exactly, so N leaves remainder 1 when divided by any pi, oeB1
- (b) states that this holds for every i from 1 to k, so no prime in the list divides N, csoB1
- (b) Answer: N leaves remainder 1 on division by each pi, so no pi divides N
- (c) states that N>1, so N must have at least one prime factor, since every integer greater than 1 has a prime factorB1
- (c) states that this prime factor cannot be any of p1, ..., pk (by part (b)), so it is a prime missing from the original list, contradicting the assumption that the list was complete, cso, ftB1
- (c) Answer: N has a prime factor not in the original list, contradicting completeness of the list
- (d) states that the assumption of finitely many primes is false, so there are infinitely many primes, cso, ftB1
- (d) Answer: There are infinitely many primes
- (e) calculates N=2x3x5+1=31M1
- (e) verifies 31 is not divisible by 2, 3 or 5 (e.g. remainder 1 in each case)A1
- (e) identifies that 31 is itself prime, a prime not in the original list {2, 3, 5}, caoA1
- (e) Answer: N=31, which is prime and not in {2, 3, 5}
- (f) calculates N=2x3x5x7x11x13+1=30031, and notes 30031=59x509 is compositeB1
- (f) states that neither 59 nor 509 is in the original list {2,3,5,7,11,13}, so N still has a prime factor missing from the list, confirming the argument holds whether or not N is prime, csoB1
- (f) Answer: N=30031=59x509; both 59 and 509 are new primes not in the original list
Mark your answers
Check answers without an account. Some answers can be checked automatically; use the mark scheme to mark the rest.