All revision notes topics

Proof by contradictionEdexcel A-Level Maths: Revision notes

Section 1

The method

In proof by contradiction you assume the opposite of what you want to prove, and then use correct logical steps to reach something impossible: a contradiction. Since every step was valid, the only faulty item must be the assumption, so the original statement is true. The write-up has four parts:

  1. State the assumption clearly, for example 'Assume 2\sqrt2 is rational'.
  2. Work logically from it.
  3. Reach a contradiction, such as a number that is both even and odd, or a fraction not in lowest terms.
  4. Conclude: 'this is a contradiction, so the assumption is false, and 2\sqrt2 is irrational'.
Key termsproof by contradictioncontradiction
Common mistake

Forgetting the concluding sentence. The contradiction must be named, and you must say it means the assumption is false.

Section 2

Rational and irrational numbers

A rational number can be written as ab\frac{a}{b} with a,ba,b integers and b≠0b\neq0. An irrational number cannot. Any rational number can be written in lowest terms, where aa and bb have no common factor other than 1. Contradiction proofs about irrationals rely on this. Useful facts about parity: a2a^2 is even ⇒\Rightarrow aa is even (an odd number is 2k+12k+1 and its square 4k2+4k+14k^2+4k+1 is odd). The same idea works for multiples of 3: if aa is 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.

Key termsrationalirrationallowest terms
Exam tip

Always assume the fraction is in lowest terms at the start. Without it, 'both even' is not a contradiction.

Section 3

The irrationality of root 2

Assume 2=ab\sqrt2=\frac{a}{b} with a,ba,b integers in lowest terms. Square: 2=a2b22=\frac{a^2}{b^2}, so a2=2b2a^2=2b^2. Hence a2a^2 is even, so aa is even. Write a=2ka=2k. Then 4k2=2b24k^2=2b^2, so b2=2k2b^2=2k^2, which is even, so bb is even. Now aa and bb are both even, so they have the common factor 2. This contradicts lowest terms. Hence 2\sqrt2 is irrational. The same pattern proves 3\sqrt3 irrational, using multiples of 3 in place of even numbers.

Key termsirrationality of root 2
Common mistake

Saying 'a2a^2 is even so aa is even' without any reason. State that the square of an odd number is odd.

Section 4

The infinity of primes

Assume there are finitely many primes p1,p2,…,pnp_1,p_2,\ldots,p_n. Let N=p1p2⋯pn+1N=p_1p_2\cdots p_n+1. Dividing NN by any pip_i leaves remainder 1, so no pip_i divides NN. Either NN is prime, or it has a prime factor. In both cases there is a prime that is not in the list. This contradicts the assumption that the list contained all primes. Hence there are infinitely many primes.

Key termsprimeinfinitely many
Common mistake

Claiming that NN is always prime. For 2×3×5×7×11×13+1=30031=59×5092\times3\times5\times7\times11\times13+1=30031=59\times509, NN is not prime, but its factors are new primes.

Section 5

Unfamiliar proofs

Strategy for a new statement: (1) negate it carefully, (2) translate the assumption into algebra, (3) manipulate to a contradiction.

  • Negation: the opposite of 'is irrational' is 'is rational'. The opposite of 'there are no integers m,nm,n with 15m+25n=115m+25n=1' is 'there are integers m,nm,n with 15m+25n=115m+25n=1'.
  • Typical contradictions: even equals odd; a fraction not in lowest terms; an integer between 0 and 1; a number divisible by 5 that equals 1. Example: prove that log⁡23\log_2 3 is irrational. Assume log⁡23=pq\log_2 3=\frac{p}{q} with p,qp,q positive integers. Then 2p=3q2^p=3^q, but 2p2^p is even and 3q3^q is odd. Contradiction.
Key termsnegation
Exam tip

If you are stuck, write down exactly what the contradiction would look like and work towards it.

That's the notes covered.

Carry on to the next subtopic.

Exam questions on Proof by contradiction

  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.
    Given that a2=2b2a^2=2b^2 and that aa is even, complete the proof that 2\sqrt{2} is irrational.2 marks
  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.
    Complete the proof that there are infinitely many primes.2 marks
  3. Assume, for a contradiction, that log⁡23=pq\log_2 3=\frac{p}{q}, where pp and qq are positive integers.
    Show that 3q=2p3^q=2^p.3 marks
See the full worksheet

Written by the Exaim team, led by Shaun Daswani (Head of Upper Secondary, Improve ME Institute; MSc Financial Mathematics, Imperial College London; BSc, UCL) and Jason Daswani (operational lead, Improve ME Institute; LSE).