Skip to main content

TMUA: Types of proof and counterexamples

Paper 2: types of proof and counterexamples.

Practise types of proof and counterexamples →Drill this topic

What the specification covers

Key ideas

Common mistakes

Exam tip

For 'which is a counterexample' questions, check each option against both halves of the statement.

Worked example

Worked example

The statement 'for every positive integer n, n2−n+11 is prime' is false. For which of the following values of n is n2−n+11 not prime?

  1. n=9
  2. n=5
  3. n=7
  4. n=11
  5. n=3

Answer: D: n=11

n=11 gives 121−11+11=121=112, not prime, so it is a counterexample. The others give 17,31,53,83, all prime.

Practice questions

Try each question before opening the solution. No calculator: the TMUA does not allow one. Every answer here was checked independently before it was published, and each solution ends with the fastest reliable method.

Question 1

Which pair a,b gives a counterexample to the statement 'if a and b are irrational, then a+b is irrational'?

  1. a=2, b=3
  2. a=1+2, b=1−2
  3. a=π, b=2π
  4. a=2, b=32
  5. a=8, b=2
Show the answer and solution

Answer: B: a=1+2, b=1−2

A counterexample needs both irrational and the sum rational. (1+2)+(1−2)=2. The other sums are 2+3, 42, 32, 3π, all irrational.

Question 2

The statement 'for every positive integer n, n2−n+17 is prime' is false. For which of the following values of n is n2−n+17 not prime?

  1. n=13
  2. n=15
  3. n=5
  4. n=17
  5. n=14
Show the answer and solution

Answer: D: n=17

n=17 gives 172−17+17=289=172, so it is not prime: a counterexample. The other values give 199, 227, 37, 173, which are all prime.

Question 3

The statement 'for every positive integer n, n2+n+41 is prime' is false. For which of the following values of n is n2+n+41 not prime?

  1. n=40
  2. n=7
  3. n=27
  4. n=18
  5. n=24
Show the answer and solution

Answer: A: n=40

n=40 gives 402+40+41=1681=412, so it is not prime: a counterexample. The other values give 97, 383, 641, 797, which are all prime.

Question 4

The statement 'for every positive integer n, n2+n+11 is prime' is false. For which of the following values of n is n2+n+11 not prime?

  1. n=7
  2. n=10
  3. n=9
  4. n=6
  5. n=2
Show the answer and solution

Answer: B: n=10

n=10 gives 102+10+11=121=112, so it is not prime: a counterexample. The other values give 101, 53, 67, 17, which are all prime.

Question 5

The statement 'for every positive integer n, n2−n+5 is prime' is false. For which of the following values of n is n2−n+5 not prime?

  1. n=4
  2. n=5
  3. n=3
  4. n=1
  5. n=2
Show the answer and solution

Answer: B: n=5

n=5 gives 52−5+5=25=52, so it is not prime: a counterexample. The other values give 7, 17, 5, 11, which are all prime.

Question 6

The statement 'for every positive integer n, n2−n+41 is prime' is false. For which of the following values of n is n2−n+41 not prime?

  1. n=26
  2. n=17
  3. n=27
  4. n=13
  5. n=41
Show the answer and solution

Answer: E: n=41

n=41 gives 412−41+41=1681=412, so it is not prime: a counterexample. The other values give 313, 743, 197, 691, which are all prime.

Question 7

The statement 'for every positive integer n, n2+n+17 is prime' is false. For which of the following values of n is n2+n+17 not prime?

  1. n=14
  2. n=15
  3. n=5
  4. n=2
  5. n=16
Show the answer and solution

Answer: E: n=16

n=16 gives 162+16+17=289=172, so it is not prime: a counterexample. The other values give 257, 47, 227, 23, which are all prime.

Question 8

Which of the following is a counterexample to the statement: 'For every positive integer n, if n2 is a multiple of 8, then n is a multiple of 8.'?

  1. n=20
  2. n=32
  3. n=25
  4. n=2
  5. n=24
Show the answer and solution

Answer: A: n=20

A counterexample must satisfy the 'if' part and fail the 'then' part. With n=20, the 'if' part (n2 is a multiple of 8) holds but the 'then' part (n is a multiple of 8) fails, so it disproves the statement. n=24 and n=32 satisfy both parts; n=25 and n=2 do not satisfy the 'if' part, so they say nothing about the statement.

Fast method: Discard options that fail the 'if' part straight away (they cannot be counterexamples), then test the 'then' part only for the rest.

Question 9

Which of the following is a counterexample to the statement: 'For every positive integer n, if n is prime, then 2n+1 is prime.'?

  1. n=36
  2. n=33
  3. n=19
  4. n=29
  5. n=11
Show the answer and solution

Answer: C: n=19

A counterexample must satisfy the 'if' part and fail the 'then' part. With n=19, the 'if' part (n is prime) holds but the 'then' part (2n+1 is prime) fails, so it disproves the statement. n=11 and n=29 satisfy both parts; n=36 and n=33 do not satisfy the 'if' part, so they say nothing about the statement.

Fast method: Discard options that fail the 'if' part straight away (they cannot be counterexamples), then test the 'then' part only for the rest.

Question 10

The function f is defined for integers n by f(n)=n5+10n2+kn+30, where k is an integer. For which value of k is f(n) a multiple of 10 for every integer n?

  1. 3
  2. −1
  3. 7
  4. 0
  5. 5
Show the answer and solution

Answer: B: −1

Write f(n)=(n5−n)+10n2+30+(k+1)n. By cases on the remainder of n on division by 10 (each remainder), n5−n is always a multiple of 10, and so are the terms with coefficient a multiple of 10. So f(n) is always a multiple of 10 exactly when (k+1)n is, for every n; taking n=1, 10 must divide k+1. Of the options only k=−1 does.

Fast method: Test n=1 first: f(1) must be a multiple of 10, which pins down k modulo 10 straight away. (Proving it works for every n is the proof-by-cases part.)

Question 11

The function f is defined for integers n by f(n)=n7−42n2+kn, where k is an integer. For which value of k is f(n) a multiple of 42 for every integer n?

  1. −1
  2. 2
  3. 9
  4. −2
  5. −11
Show the answer and solution

Answer: A: −1

Write f(n)=(n7−n)−42n2+(k+1)n. By cases on the remainder of n on division by 42 (each remainder), n7−n is always a multiple of 42, and so are the terms with coefficient a multiple of 42. So f(n) is always a multiple of 42 exactly when (k+1)n is, for every n; taking n=1, 42 must divide k+1. Of the options only k=−1 does.

Fast method: Test n=1 first: f(1) must be a multiple of 42, which pins down k modulo 42 straight away. (Proving it works for every n is the proof-by-cases part.)

Question 12

A student wants to prove, by contradiction, the statement 'If p is a prime greater than 3, then p2−1 is a multiple of 24.' Which of the following should the proof assume at the start?

  1. If p is not a prime greater than 3, then p2−1 is not a multiple of 24
  2. p is not a prime greater than 3 and p2−1 is not a multiple of 24
  3. p is a prime greater than 3 and p2−1 is not a multiple of 24
  4. p2−1 is not a multiple of 24
  5. p is a prime greater than 3 and p2−1 is a multiple of 24
Show the answer and solution

Answer: C: p is a prime greater than 3 and p2−1 is not a multiple of 24

A statement 'if P then Q' is false exactly when P is true and Q is false. A proof by contradiction assumes the statement is false, so it starts from: p is a prime greater than 3 and p2−1 is not a multiple of 24, and derives something impossible. The other options either drop the 'if' part, assume the conclusion, or are the converse or inverse.

Fast method: The negation of 'if P then Q' is 'P and not Q' (never another if-then statement). Find the option that keeps P and negates Q.

Question 13

A student wants to prove, by contradiction, the statement 'If N is the sum of two odd squares, then N is not a perfect square.' Which of the following should the proof assume at the start?

  1. N is not the sum of two odd squares and N is not a perfect square
  2. N is not the sum of two odd squares and N is a perfect square
  3. If N is not the sum of two odd squares, then N is a perfect square
  4. N is the sum of two odd squares and N is not a perfect square
  5. N is the sum of two odd squares and N is a perfect square
Show the answer and solution

Answer: E: N is the sum of two odd squares and N is a perfect square

A statement 'if P then Q' is false exactly when P is true and Q is false. A proof by contradiction assumes the statement is false, so it starts from: N is the sum of two odd squares and N is a perfect square, and derives something impossible. The other options either drop the 'if' part, assume the conclusion, or are the converse or inverse.

Fast method: The negation of 'if P then Q' is 'P and not Q' (never another if-then statement). Find the option that keeps P and negates Q.

38 more types of proof and counterexamples questions

Each with a full worked solution and a fast-method note. They also appear in topic drills, spaced review and mock papers 3 to 10.

Included with A Level plans, and with IB, IGCSE or CBSE plans.

Keep going

The next topic in the specification: notes, a worked example and free questions.

Next: Deductions, conjectures and ordering proofs

Previous: Quantifiers and negation · Drill types of proof and counterexamples · Free TMUA mock paper 1 · Timed practice paper · TMUA Paper 2: logic and proof · A Level Maths: Proof

TMUA is run by UAT-UK. A Level Math Revision is independent: it is not affiliated with or endorsed by UAT-UK, Pearson VUE or any university. Every question here is our own.