Disproof by counter example

Disproof by counter example Test

Spec 1.3 · Edexcel International A Level Maths: Subtopic test

Studying this course? Keep your progress in one place.

Two ways to do this test

Question by question

One question at a time. Each answer is marked the moment you hand it in, so you learn as you go. Drago helps if you get stuck. All 10 questions, or just 5.

Exam mode

The whole paper in one go, timed like the real exam. Nothing is marked until you hand it in, then you get every mark explained.

10 questions, 27 marks

Edexcel International A Level Maths

Disproof by counter example

Total 27 marks

Name

Class

Date

  1. 1
    A statement T is made: for all real numbers xx, x2>xx^2>x.
    (a)
    Which value of xx is a counterexample to T?
    [1 mark]
    • Ax=2x=2
    • Bx=−3x=-3
    • Cx=1x=1
    • Dx=5x=5
    Show the mark scheme

    Mark scheme

    Answer: C
    (b)
    What is the smallest number of counterexamples needed to disprove T?
    [1 mark]
    • AOne
    • BTwo
    • CThree
    • DEvery real number
    Show the mark scheme

    Mark scheme

    Answer: A
    (c)
    Find a value of xx with 0<x<10<x<1 and use it to show that T is false.
    [2 marks]
    Show the mark scheme

    Mark scheme

    M1: chooses a value 0<x<10<x<1 (e.g. x=0.5x=0.5) and substitutes into x2x^2 and xx
    A1: e.g.
    0.250.25 is not greater than 0.50.5, so T is false
    Accept: any value with
    0<x<10<x<1 and the correct comparison
    Do not accept: a value that satisfies T

    Total for question 1: 4 marks

  2. 2
    A student states: 'If pp is a prime number, then p+2p+2 is also a prime number.'
    (a)
    Which value of pp is a counterexample to the statement?
    [1 mark]
    • Ap=3p=3
    • Bp=5p=5
    • Cp=11p=11
    • Dp=7p=7
    Show the mark scheme

    Mark scheme

    Answer: D
    (b)
    The student finds that p=11p=11 gives 1313, which is prime. What does this show?
    [1 mark]
    • AThe statement is true for all primes
    • BThe statement is not disproved by p=11p=11, but one agreeing case does not prove it
    • CThe statement is false
    • Dp=11p=11 is a counterexample
    Show the mark scheme

    Mark scheme

    Answer: B
    (c)
    Find a counterexample to the statement with p>10p>10. Show your working.
    [2 marks]
    Show the mark scheme

    Mark scheme

    M1: chooses a prime p>10p>10 and evaluates p+2p+2
    A1: e.g.
    p=13p=13 and p+2=15=3×5p+2=15=3\times5, which is not prime
    Accept:
    p=19p=19 (2121), p=23p=23 (2525), p=31p=31 (3333) or other valid primes
    Do not accept:
    p=11p=11, 1717 or 2929, where p+2p+2 is prime

    Total for question 2: 4 marks

  3. 3
    Consider the statement U: n2−n+1n^2-n+1 is a prime number for all integers n≥2n\ge2.
    (a)
    Disprove U.
    [3 marks]
    Show the mark scheme

    Mark scheme

    M1: substitutes values of n≥2n\ge2 into n2−n+1n^2-n+1 (until a non-prime is found)
    A1:
    n=5n=5 gives 2121
    B1:
    21=3×721=3\times7 is not prime, so U is false
    Accept: any valid counterexample with a correct factorisation
    (b)
    A student checks n=2,3,4n=2,3,4 for U, finds 3,7,133,7,13 (all prime) and concludes that U is true. (i) Explain why this conclusion is not valid. (ii) The student then claims that n2+n+1n^2+n+1 is prime for all integers n≥2n\ge2. Find a counterexample to this claim.
    [4 marks]
    Show the mark scheme

    Mark scheme

    B1: (i) examples that agree with a statement do not prove it for all nn
    B1: (i) a single counterexample is enough to disprove a statement

    M1: (ii) evaluates
    n2+n+1n^2+n+1 for values of n≥2n\ge2, e.g. 7,13,217,13,21
    A1: (ii)
    n=4n=4 gives 21=3×721=3\times7, which is not prime
    Accept:
    n=7n=7 (57=3×1957=3\times19) or n=10n=10 (111=3×37111=3\times37)

    Total for question 3: 7 marks

  4. 4
    Statements about numbers can be disproved with a single counterexample. A calculator may be used.
    (a)
    Disprove each statement by giving a counterexample and showing that it works. (i) If aa and bb are real numbers with a2=b2a^2=b^2, then a=ba=b. (ii) 2n+12^n+1 is prime for all positive integers nn. (iii) x2+9=x+3\sqrt{x^2+9}=x+3 for all real xx.
    [6 marks]
    Show the mark scheme

    Mark scheme

    B1: (i) e.g. a=3, b=−3a=3,\ b=-3 (any a=−b≠0a=-b\ne0)
    B1: (i)
    a2=b2=9a^2=b^2=9 but a≠ba\ne b
    B1: (ii)
    n=3n=3
    Accept:
    n=5n=5 (33=3×1133=3\times11) or n=6n=6 (65=5×1365=5\times13)
    B1: (ii)
    23+1=9=3×32^3+1=9=3\times3, which is not prime
    B1: (iii) a non-zero value of
    xx, e.g. x=4x=4
    B1: (iii)
    25=5\sqrt{25}=5 but 4+3=74+3=7
    Do not accept:
    x=0x=0 in (iii), where both sides equal 3
    (b)
    Dana claims that (x+1)2>x2+1(x+1)^2>x^2+1 for all real xx. She tests x=1,2,3x=1,2,3 and 1010 and the claim holds each time. (i) Explain why this is not a proof. (ii) Disprove the claim with a counterexample. (iii) Show that the claim is true only when x>0x>0.
    [6 marks]
    Show the mark scheme

    Mark scheme

    B1: (i) four examples cannot cover all real values of xx
    B1: (i) all her values are positive, so she has not tested the other kinds of number (zero, negatives)

    B1: (ii) a value
    x≤0x\le0, e.g. x=−1x=-1
    B1: (ii)
    (−1+1)2=0(-1+1)^2=0, which is not greater than (−1)2+1=2(-1)^2+1=2
    M1: (iii) expands to find
    (x+1)2−(x2+1)=2x(x+1)^2-(x^2+1)=2x
    A1: (iii)
    2x>02x>0 only when x>0x>0
    Accept:
    x=0x=0 in (ii), where both sides equal 1

    Total for question 4: 12 marks

End of questions

Subtopic tests