A-level · Proof
Disproof by counter-exampleExam-style questions
Disproving a universal ("for all") claim with a single example where it fails — shown with the arithmetic worked out. Why one counter-example is enough to disprove, why no number of supporting examples can prove, and where to hunt for the case that breaks a statement.
11 questions · A-level level · mark scheme and worked solution on each · no sign-up to try
- 1SECTION A: PURE MATHEMATICS
(a) Disprove the following statement:
" is prime for all positive integers ." (2 marks)
(b) Prove that the sum of the squares of any two consecutive odd integers is an even number that is not divisible by . (3 marks)Level 2 · 5 marksTry it - 2A student writes the following two statements.
(a) “For all positive integers , ”
Prove by counter example that this statement is not true.
(2 marks)
(b) “For all real numbers , if then ”
Prove by counter example that this statement is not true.
(2 marks)Level 2 · 4 marksTry it - 3(a) Find a counterexample to disprove the statement that, for all non-zero real numbers and , if then .
(1 mark)
(b) Replace in each of the following with , or so that each statement is fully correct.
(i)
(ii)
(iii)
(3 marks)Level 3 · 4 marksTry it - 4(a) Show, by means of a counter example, that the following statement is not true.
"For every , the number is prime."
(2 marks)
(b) Using algebra, prove by exhaustion that there is no for which is a multiple of 4
(4 marks)Level 3 · 6 marksTry it - 5(a) Consider the statement
"Whenever is a multiple of 8, must also be a multiple of 8"
Give a counter example to show that this statement is false.
(1 mark)
(b) Given that is an odd integer, use algebra to prove that
is a multiple of 4 but is not a multiple of 8
(4 marks)Level 3 · 5 marksTry it
6 more questions on disproof by counter-example
Free with an account — just an email, no card. The whole bank, every mark scheme and worked solution.