Proof by contradiction

Proof by contradiction Test

Spec 1.1 · Edexcel 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 A-Level Maths

Proof by contradiction

Total 27 marks

Name

Class

Date

  1. 1
    A student begins a proof that 2\sqrt{2} is irrational by assuming that 2=ab\sqrt{2}=\frac{a}{b}, where aa and bb are integers and b≠0b\neq0.
    (a)
    What further assumption must be made at the start of the proof?
    [1 mark]
    • Aaa and bb are both even.
    • Bb=1b=1.
    • Ca>ba>b.
    • Daa and bb have no common factor other than 1, so ab\frac{a}{b} is in its lowest terms.
    Show the mark scheme

    Mark scheme

    Answer: D
    (b)
    Squaring gives a2=2b2a^2=2b^2. What can be deduced immediately?
    [1 mark]
    • Aa2a^2 is even, so aa is even.
    • Bbb is even.
    • Ca=2ba=2b.
    • Daa is odd.
    Show the mark scheme

    Mark scheme

    Answer: A
    (c)
    Given that a2=2b2a^2=2b^2 and that aa is even, complete the proof that 2\sqrt{2} is irrational.
    [2 marks]
    Show the mark scheme

    Mark scheme

    M1: a=2ka=2k for an integer kk, so 4k2=2b24k^2=2b^2 and b2=2k2b^2=2k^2
    A1:
    b2b^2 is even so bb is even; both aa and bb are even, contradicting lowest terms, so 2\sqrt2 is irrational
    Do not accept: no reference to the contradiction

    Total for question 1: 4 marks

  2. 2
    Euclid's proof that there are infinitely many primes begins by assuming that there is a finite number of primes, p1,p2,…,pnp_1,p_2,\ldots,p_n, and then considers N=p1p2⋯pn+1N=p_1p_2\cdots p_n+1.
    (a)
    What is the remainder when NN is divided by any one of the primes pip_i?
    [1 mark]
    • A00
    • B11
    • Cpip_i
    • Dpi−1p_i-1
    Show the mark scheme

    Mark scheme

    Answer: B
    (b)
    Which is the correct deduction about NN?
    [1 mark]
    • ANN is divisible by p1p_1.
    • BNN is a multiple of every prime in the list.
    • CEither NN is prime or it has a prime factor that is not in the list.
    • DNN must be a square number.
    Show the mark scheme

    Mark scheme

    Answer: C
    (c)
    Complete the proof that there are infinitely many primes.
    [2 marks]
    Show the mark scheme

    Mark scheme

    M1: NN is prime, or has a prime factor, that is not in the list p1,…,pnp_1,\ldots,p_n
    A1: this contradicts the list containing all the primes, so the assumption is false and there are infinitely many primes

    Do not accept: 'N is the next prime' without a contradiction

    Total for question 2: 4 marks

  3. 3
    Assume, for a contradiction, that log⁡23=pq\log_2 3=\frac{p}{q}, where pp and qq are positive integers.
    (a)
    Show that 3q=2p3^q=2^p.
    [3 marks]
    Show the mark scheme

    Mark scheme

    M1: log⁡23=pq\log_2 3=\frac{p}{q} means 2p/q=32^{p/q}=3
    M1: raises both sides to the power
    qq: (2p/q)q=3q\left(2^{p/q}\right)^q=3^q
    A1:
    2p=3q2^p=3^q (AG)
    (b)
    Hence complete the proof that log⁡23\log_2 3 is irrational.
    [4 marks]
    Show the mark scheme

    Mark scheme

    B1: 2p2^p is even, as p⩾1p\geqslant1 (log⁡23>0\log_2 3>0 so p>0p>0)
    B1:
    3q3^q is odd, as a product of odd numbers
    M1: an even number cannot equal an odd number, which is a contradiction

    A1: so the assumption is false and
    log⁡23\log_2 3 is irrational
    Accept: unique prime factorisation used to show
    2p≠3q2^p\neq3^q

    Total for question 3: 7 marks

  4. 4
    You may use the fact that a rational number can be written as mn\frac{m}{n} where mm and nn are integers and n≠0n\neq0.
    (a)
    Prove by contradiction that 3\sqrt{3} is irrational.
    [6 marks]
    Show the mark scheme

    Mark scheme

    B1: assume 3=ab\sqrt3=\frac{a}{b} with a,ba,b integers having no common factor other than 1
    M1:
    3b2=a23b^2=a^2, so a2a^2 is a multiple of 3
    M1: if
    aa were not a multiple of 3 then a=3k±1a=3k\pm1 and a2=3(3k2±2k)+1a^2=3(3k^2\pm2k)+1 is not a multiple of 3, so aa is a multiple of 3
    M1:
    a=3ka=3k gives 9k2=3b29k^2=3b^2, so b2=3k2b^2=3k^2
    A1:
    b2b^2 is a multiple of 3, so bb is a multiple of 3
    R1:
    aa and bb share the factor 3, contradicting lowest terms, so 3\sqrt3 is irrational
    Accept: the argument that a square is a multiple of 3 only if its root is, stated and justified
    (b)
    Prove by contradiction that the sum of a rational number and an irrational number is irrational. Hence show that 2+32+\sqrt{3} is irrational.
    [6 marks]
    Show the mark scheme

    Mark scheme

    B1: assume rational ab\frac{a}{b} plus irrational ss equals a rational number cd\frac{c}{d}, with b,d≠0b,d\neq0
    M1:
    s=cd−ab=bc−adbds=\frac{c}{d}-\frac{a}{b}=\frac{bc-ad}{bd}
    A1:
    bc−adbc-ad and bdbd are integers with bd≠0bd\neq0, so ss is rational
    R1: contradiction, so the sum is irrational

    B1:
    22 is rational and 3\sqrt3 is irrational (from (a))
    A1: so
    2+32+\sqrt3 is irrational
    Accept: any correct choice of letters

    Total for question 4: 12 marks

End of questions

Subtopic tests