Disproof by counter example

Disproof by counter example

Spec 1.3 · Edexcel International A Level Maths: Revision notes

Studying this course? Keep your progress in one place.

Key facts

  • A statement about all values is disproved by a single counterexample.
  • The counterexample must satisfy the conditions of the statement.
  • Substitute it, show the statement fails, and write a conclusion.
  • Test small values, zero, negatives, fractions between 00 and 11, and 22 for primes.
  • Examples that agree can never prove a statement.

What a counterexample does

One valid value for which the statement is false is enough to disprove it.

Many statements say something is true for all values in a set, such as "for all integers n≥2n\ge2". To disprove one you need only a single counterexample.

That is why disproof is simpler than proof. The value must satisfy the conditions of the statement, and you must show clearly that it fails.

051015202345nn² − n + 1
Testing 'n² − n + 1 is prime': the values for n = 2, 3, 4 are prime (3, 7, 13) but n = 5 gives 21 = 3 × 7, one counterexample.
  • One valid counterexampledisproves the statement

How many counterexamples do you need to disprove a statement?

Setting out a disproof

Choose a valid value, substitute it, show the statement fails, and conclude.

Calculate both sides, or each part of the statement. When the statement is about prime numbers, show the factors of the non-prime value, for example 21=3×721=3\times7.

  1. 1

    Choose

    A value that satisfies the conditions

  2. 2

    Substitute

    Calculate both sides or each part

  3. 3

    Show it fails

    Give the factors if a number is not prime

  4. 4

    Conclude

    "So the statement is false"

The same steps every time.

Worked example

Disprove the statement: 'n2−n+1n^2-n+1 is prime for all integers n≥2n\ge2'.

Is n=1n=1 a valid test value for the statement above?

Choosing values to test

Try small values first, then zero, 11, negatives, fractions between 00 and 11, and the prime 22.

Fractions between 00 and 11 are useful because squares are smaller, not larger. Numbers of opposite sign, such as a=3a=3 and b=−3b=-3, help when the statement involves squares.

−1−0.50.511.521234xy(½, ¼)(1, 1)y = x²y = x
Between 0 and 1 the curve y = x² lies below the line y = x, so x² > x fails at x = ½.

Worked example

Disprove statement T: 'x2>xx^2>x for all real xx'.

Which value is a counterexample to 'x2>xx^2>x for all real xx'?

Further examples

Each follows the same pattern: test values, find one that fails, and state it.

Keep testing different kinds of values until one fails.

−2−11234567824681012xy(4, 5)(4, 7)y = √(x²+9)y = x + 3
Disproving √(x²+9) = x+3: the curves meet only at x = 0, and at x = 4 they give 5 and 7.

Counterexample

If pp is prime then p+2p+2 is prime:
p=7p=7
If a2=b2a^2=b^2 then a=ba=b:
a=3a=3, b=−3b=-3
2n+12^n+1 is prime:
n=3n=3
x2+9=x+3\sqrt{x^2+9}=x+3:
x=4x=4

Why it fails

If pp is prime then p+2p+2 is prime:
7+2=9=3×37+2=9=3\times3
If a2=b2a^2=b^2 then a=ba=b:
a2=b2=9a^2=b^2=9 but a≠ba\ne b
2n+12^n+1 is prime:
23+1=9=3×32^3+1=9=3\times3
x2+9=x+3\sqrt{x^2+9}=x+3:
25=5\sqrt{25}=5 but 4+3=74+3=7

Worked example 1

Disprove: 'If pp is prime then p+2p+2 is prime.'

Worked example 2

Disprove: 'If a2=b2a^2=b^2 then a=ba=b.'

Which value is a counterexample to 'if pp is prime then p+2p+2 is prime'?

What disproof cannot do

A counterexample disproves a statement, but examples that agree can never prove one.

You need only one counterexample: not all of them, and not an explanation of why. If a student tests a few values and calls it proved, a finite number of agreeing cases says nothing about the rest.

−3−2−1123246810xy(0, 1)(−1, 0)(−1, 2)y = (x+1)²y = x² + 1
(x+1)² and x²+1 differ by 2x. They agree at x = 0 but not at x = −1, so the statement is false for x ≤ 0.
  • Counterexampledisproves
  • Agreeing examplesnever prove

Worked example

Is '(x+1)2>x2+1(x+1)^2>x^2+1 for all real xx' true?

A student tests n=1,2,3n=1,2,3 and says the statement is proved. Why is this wrong?

Try an exam question

A student says "2n+12n+1 is prime for every positive integer nn". Show that the student is wrong.

[3 marks]

That's the notes covered.

Carry on to the next subtopic.

Try a question

Which value of xx is a counterexample to T?

1 mark, marked against the mark scheme

Revision notes