Skip to topic
    ← Back to course topics

    Proof — OCR A-Level Mathematics

    Proof explained

    A single counterexample is enough to disprove a statement that claims to hold for all cases.

    Read the full explanation

    The method is to read the claim carefully, note its quantifier and conditions, then find one permitted case where the claim fails. For example, to disprove the claim that every prime number is odd, offer 2, which is prime and even. To disprove that n² + n + 41 is prime for all positive integers n, evaluate at n = 41 and show the result is divisible by 41. A valid counterexample must lie inside the stated domain, must satisfy every hypothesis, and must make the conclusion false; then state clearly which condition it breaks.

    Your focus

    1. Construct a single valid counterexample to a universal mathematical statement.
    2. Verify that a chosen counterexample satisfies the hypothesis and breaks the conclusion.
    3. Explain why one counterexample is sufficient to disprove a universal claim.

    Proof exam tips

    Marking Points
    • States a single specific case that lies within the domain named by the claim.
    • Shows that the chosen case satisfies every hypothesis of the statement.
    • Demonstrates by calculation that the conclusion fails for that case.
    • Concludes explicitly that the statement is false because one counterexample suffices.
    • Keeps the counterexample inside the stated domain, for example using a positive integer when the claim is restricted to positive integers.
    Examiner Tips
    • 💡Write down the domain and hypothesis before hunting for a value, so your example is admissible.
    • 💡Show the substitution and the resulting value explicitly rather than stating the failure.
    • 💡Finish with a sentence saying the statement is disproved, because the conclusion must be drawn.
    • 💡Try small values, boundary values and the number appearing in the expression first, as these often break universal claims.
    Common Mistakes
    • Offers a case outside the stated domain; check the quantifier and restrictions before choosing a value.
    • Gives a case that fails the hypothesis rather than the conclusion; verify the hypothesis holds first.
    • Asserts the counterexample without showing the arithmetic; display the evaluation that makes the conclusion false.
    • Tries to disprove a universal claim by listing many supporting examples; one valid counterexample is what is needed.