Disproof by Counterexample Exam Questions: A-Level
Disproof by counterexample exam questions A-Level Maths guide with three worked examples, indicative method marks, common errors and clear practice advice.

A universal statement can look convincing for ten examples and still collapse on the eleventh. That is what makes disproof by counterexample exam questions A-Level Maths students meet both simple and deceptive. You do not need to prove the statement false in every case. You need one valid example that satisfies the conditions but contradicts the conclusion.
The method is short: understand the claim, respect its domain, choose a counterexample, verify it and state why the original claim is false. The challenge is making every part explicit enough to earn the marks.
Imagine a student called Maya working through three exam-style questions. Her first instinct is to search for a long algebraic proof. She soon discovers that the better question is much smaller: what is the simplest value that breaks this statement?
The counterexample method
Use this checklist whenever a question asks you to disprove a statement:
- Identify words such as “all”, “every” or “for any”. These signal a universal claim.
- Check the permitted domain, such as integers, positive integers or real numbers.
- Find one value that satisfies every condition in the question.
- Substitute it into the statement and show the contradiction clearly.
- Finish with an explicit conclusion that the statement is false.
A counterexample disproves a universal statement because such a statement claims there are no exceptions. Finding one exception is enough.
This is part of the proof content found in A-Level Maths specifications. You can review the underlying ideas in the structure and methods of proof lesson or watch the OCR A-Level proof video lessons.
Once you have this five-step method in hand, open the Maths Genie Lessons and Question Bank so you can practise choosing counterexamples rather than merely recognising them.
Exam-style question: a claim about prime numbers
Maya begins with a familiar statement.
Question
Disprove the following statement by giving a counterexample:
Every prime number is odd.
Worked solution with indicative marks
Choose the prime number 222. [M1]
The number 222 is even, not odd. Therefore, 222 is a counterexample and the statement is false. [A1]
Why this earns the marks
The first mark rewards a relevant counterexample. The second rewards the verification and conclusion. Writing only “222” may communicate the idea, but it does not fully explain why the claim fails.
The best counterexamples are often ordinary. Maya initially considers testing several larger primes, but that adds work without adding certainty. One decisive exception is stronger than a list of examples that agree with the claim.
Exam-style question: testing an inequality
The next statement looks more algebraic, but the same method applies.
Question
A student claims that x2>xx^2>xx2>x for every real value of xxx. Disprove the claim by giving a counterexample.
Worked solution with indicative marks
Take x=1x=1x=1. [M1]
Then
x2=12=1.x^2=1^2=1.x2=12=1.Therefore x2=xx^2=xx2=x, so x2>xx^2>xx2>x is not true when x=1x=1x=1. The original claim is false. [A1]
Why equality can be a counterexample
Maya pauses here because the left-hand side is not smaller than the right-hand side. It does not need to be. The claim uses the strict inequality >>>, so equality is enough to make it false.
Other counterexamples exist. For example, when x=12x=\frac{1}{2}x=21,
x2=14<12=x.x^2=\frac{1}{4}<\frac{1}{2}=x.x2=41<21=x.However, an exam answer only needs one valid counterexample unless the question asks for more. The value x=1x=1x=1 is quicker and less prone to arithmetic errors.
This is a useful lesson for a disproof by counterexample past paper question: inspect boundary values such as 000, 111 and −1-1−1 before attempting complicated substitutions.
Exam-style question: divisibility and implication
The third question tests whether Maya can separate a condition from a conclusion.
Question
Let nnn be an integer. A student makes the following claim:
If n2n^2n2 is divisible by 444, then nnn is divisible by 444.
Disprove the claim by giving a counterexample.
Worked solution with indicative marks
Let n=2n=2n=2. [M1]
Then
n2=22=4,n^2=2^2=4,n2=22=4,which is divisible by 444. [A1]
However, 222 is not divisible by 444. Therefore n=2n=2n=2 satisfies the condition but not the conclusion, so the claim is false. [A1]
Reading an implication correctly
A statement of the form “if PPP, then QQQ” is disproved by finding a case in which PPP is true but QQQ is false. A value for which both parts are false does not disprove the implication.
That distinction is where many marks are lost. Maya first thinks about n=3n=3n=3. But 32=93^2=932=9 is not divisible by 444, so the condition has not been met. The value tells us nothing about what happens when n2n^2n2 actually is divisible by 444.
The successful value n=2n=2n=2 does both jobs: its square meets the condition, while the number itself contradicts the conclusion.
How a counterexample mark scheme awards credit
The labels above are indicative method and accuracy marks, not reproductions of a specific examination mark scheme. Exact allocation depends on the paper and exam board. Nevertheless, a typical disproof by counterexample mark scheme rewards three elements:
- selecting a value from the correct domain;
- demonstrating that it satisfies the relevant condition;
- explaining how it contradicts the claim.
Your final line matters. Write something direct, such as: “Therefore n=2n=2n=2 is a counterexample, so the statement is false.” This removes any ambiguity about the purpose of your calculation.
To see how marks are presented alongside worked solutions, try an OCR proof question with its mark scheme. You can also select your specification through the Edexcel A-Level Maths Question Bank, AQA A-Level Maths Question Bank, OCR A-Level Maths Question Bank or WJEC A-Level Maths Question Bank.
Common mistakes in counterexample questions
Giving an example that supports the statement
Testing n=8n=8n=8 in the third question gives n2=64n^2=64n2=64, with both numbers divisible by 444. That agrees with the claim, but agreement does not prove a universal statement and cannot disprove it.
Ignoring the domain
If a statement concerns positive integers, 000, negative numbers and fractions are not permitted counterexamples. A mathematically interesting value earns nothing if it falls outside the stated domain.
Contradicting the wrong part
For an implication, the condition must be true and the conclusion false. If the initial condition is false, the example is irrelevant.
Writing only a number
A bare value may not show enough reasoning. Substitute it, verify the required facts and state the conclusion.
Trying to prove too much
You do not need to classify every value for which the claim fails. Counterexample questions reward one correct exception, not an exhaustive investigation.
Exam-style practice
Try these without looking at the prompts above:
- Disprove: every multiple of 333 is odd.
- Disprove: x2+1>2xx^2+1>2xx2+1>2x for every real value of xxx.
- Disprove: if an integer is divisible by 666, it is divisible by 444.
- Disprove: the sum of two irrational numbers is always irrational.
For each one, write three lines: your chosen value or values, the calculation that checks the conditions, and a sentence explaining the contradiction. Then compare your reasoning with a worked solution or mark scheme rather than checking only the final value.
Turn the method into exam marks
Maya’s progress is modest but important: she stops searching for lengthy proofs and starts testing the domain, boundary values and logical conditions. Knowing the method is only the first step; using it reliably under exam pressure requires focused questions with feedback. Start with the matching Maths Genie Lessons and Question Bank, then practise disproof by counterexample until choosing and verifying one decisive exception becomes automatic.



