Scribe logoScribeNotes & practice
Sign inStart free
  1. Notes
  2. ›Edexcel A-level Mathematics
  3. ›P Pure mathematics
  4. ›P1 Proof

Edexcel A-level Mathematics · P · Pure mathematics

P1 Proof

Write proofs by deduction, exhaustion and contradiction, and disprove a false statement with a counter-example.

  • 5 min read
  • 6 parts
  • 10 questions
  • Draft
Start a Quick 5 on this topic→Jump to the 10 questions
1/6A proof by deduction shows a result holds for every case
  1. 1A proof by deduction shows a result holds for every case
  2. 2Algebraic proofs finish by showing the required form
  3. 3Proof by exhaustion checks every possible case
  4. 4A single counter-example disproves a statement
  5. 5Proof by contradiction assumes the opposite and fails
  6. 6Each method suits a particular kind of statement
  7. Check your recall
  8. Practice: 10 questions
1

Part 1 of 6: A proof by deduction shows a result holds for every case

Suppose two odd numbers always seem to add to an even number. Checking more pairs makes the pattern likelier, but it never settles the matter. A proof by deduction starts from known facts. Valid steps then lead to the result for every case.

Letters make this possible. Any even number can be written 2n2n2n, where nnn is an integer. Any odd number can be written 2n+12n+12n+1.

Common mistake

Testing many examples is not a proof. A pattern that works for a hundred cases can still fail on the next one.

Key terms · tap one for its definition

proof by deduction

A proof by deduction is a logical argument that uses known facts and valid steps to establish a result for all cases.

integer

An integer is a whole number that may be positive, negative or zero.

Part 1 done

2

Part 2 of 6: Algebraic proofs finish by showing the required form

Now put these letters to work. Most algebraic proofs follow the same four steps, and the final form depends on the claim. For a multiple of 3, the required form is 3 times an integer.

  • Define the objects in the claim using letters.
  • Expand and simplify the resulting expression.
  • Factorise to reveal the form the claim names.
  • Finish with a conclusion in words.

Worked example

Sum of three consecutive integers

Prove that the sum of any three consecutive integers is a multiple of 3.
  1. 1
    Let the integers be nnn, n+1n+1n+1 and n+2n+2n+2, where nnn is an integer.
  2. 2
    Add them: n+(n+1)+(n+2)=3n+3n+(n+1)+(n+2)=3n+3n+(n+1)+(n+2)=3n+3.
  3. 3
    Factorise: 3n+3=3(n+1)3n+3=3(n+1)3n+3=3(n+1).
  4. 4
    Since n+1n+1n+1 is an integer, 3(n+1)3(n+1)3(n+1) is a multiple of 3.

Answer: The sum of any three consecutive integers is a multiple of 3.

End every proof with a short sentence in words. It should state that the result holds for all integers nnn, because nnn could stand for any integer.

Part 2 done

Quick check

One question on the part you just read

Easy

Identify the general form of an odd integer, where nnn is an integer.
Show answer and explanation

Answer: B · Worked explanation

An odd integer is one more than an even integer, so it has the form 2n+12n+12n+1. The form 2n2n2n describes an even integer, because it is exactly divisible by 2. Both n+2n+2n+2 and n2n^2n2 can be odd or even depending on nnn, so neither is a general form for odd integers.
3

Part 3 of 6: Proof by exhaustion checks every possible case

Sometimes one algebraic line cannot cover everything. Instead, the statement splits into separate cases. A common split is into even and odd integers, because every integer is one or the other. In proof by exhaustion, you show the statement is true in each case, and the cases together cover every possibility.

Worked example

An expression that is always even

Prove that n2+nn^2+nn2+n is even for every integer nnn.
  1. 1
    Every integer is even or odd, so two cases cover all possibilities.
  2. 2
    Case 1, n=2kn=2kn=2k: n2+n=4k2+2k=2(2k2+k)n^2+n=4k^2+2k=2(2k^2+k)n2+n=4k2+2k=2(2k2+k), which is even.
  3. 3
    Case 2, n=2k+1n=2k+1n=2k+1: n2+n=(4k2+4k+1)+(2k+1)=4k2+6k+2n^2+n=(4k^2+4k+1)+(2k+1)=4k^2+6k+2n2+n=(4k2+4k+1)+(2k+1)=4k2+6k+2.
  4. 4
    Factorise: 4k2+6k+2=2(2k2+3k+1)4k^2+6k+2=2(2k^2+3k+1)4k2+6k+2=2(2k2+3k+1), which is even.

Answer: Both cases give an even number, so n2+nn^2+nn2+n is even for every integer nnn.

The cases may also be a short list of values, such as every integer from 1 to 5. Checking each one then completes the proof.

Exam tip

Say why your cases are complete. For integers, write ‘every integer is either even or odd’.

Key term

proof by exhaustion

A proof by exhaustion is a proof that splits a statement into a finite set of cases and checks every case.

Part 3 done

4

Part 4 of 6: A single counter-example disproves a statement

A proof shows a statement is always true. Showing it is false needs far less. One case where the statement fails is enough, and it is called a counter-example.

No number of true examples can prove a statement. A single false example can disprove it. To find one, try small values first, then try special values such as 0, 1 and negative numbers.

Worked example

Disproving a claim about primes

Disprove the statement: ‘n2+n+11n^2+n+11n2+n+11 is prime for every positive integer nnn’.
  1. 1
    Try small values: n=1n=1n=1 gives 13, n=2n=2n=2 gives 17 and n=3n=3n=3 gives 23. All are prime.
  2. 2
    Keep searching. For n=10n=10n=10: 102+10+11=12110^2+10+11=121102+10+11=121.
  3. 3
    Factorise: 121=11×11121=11\times11121=11×11, so 121 is not prime.

Answer: n=10n=10n=10 is a counter-example, so the statement is false.

Common mistake

A counter-example must meet the conditions of the statement and break its claim. Check both before you finish.

Key term

counter-example

A counter-example is a single case that meets the conditions of a statement but makes its claim false.

Part 4 done

Quick check

One question on the part you just read

Easy

State the effect of finding one counter-example to a statement.
Show answer and explanation

Answer: A · Worked explanation

A statement that claims to hold in every case fails as soon as one case breaks it. So one counter-example shows the statement is false. It does not make the statement true except for that case, because the original claim covered all cases and is now untrue.
5

Part 5 of 6: Proof by contradiction assumes the opposite and fails

Some results are hard to prove directly. Here you assume the statement is false. If that assumption leads to something impossible, the statement must be true. This is proof by contradiction.

It suits claims about irrational numbers. A rational number can be written as ab\frac{a}{b}ba​, where aaa and bbb are integers and b≠0b\neq0b=0. An irrational number cannot be written in that form.

Worked example

The square root of 2 is irrational

Prove that 2\sqrt{2}2​ is irrational.
  1. 1
    Assume 2\sqrt{2}2​ is rational. Then 2=ab\sqrt{2}=\frac{a}{b}2​=ba​, where aaa and bbb are integers with no common factor.
  2. 2
    Square both sides: 2=a2b22=\frac{a^2}{b^2}2=b2a2​, so a2=2b2a^2=2b^2a2=2b2.
  3. 3
    So a2a^2a2 is even. The square of an odd number is odd, so aaa must be even.
  4. 4
    Write a=2ka=2ka=2k. Then 4k2=2b24k^2=2b^24k2=2b2, so b2=2k2b^2=2k^2b2=2k2.
  5. 5
    So b2b^2b2 is even, and in the same way bbb is even.
  6. 6
    Now aaa and bbb share the factor 2. This contradicts the assumption that they have no common factor.

Answer: The assumption is false, so 2\sqrt{2}2​ is irrational.

Every step above follows from the one before it. The contradiction therefore comes from the opening assumption, not from the working. That is why the assumption must be false, and the opposite statement is proved.

Go deeperWhy the square of an odd number is odd

Let an odd number be 2k+12k+12k+1. Its square is 4k2+4k+14k^2+4k+14k2+4k+1, which equals 2(2k2+2k)+12(2k^2+2k)+12(2k2+2k)+1. This is odd.

So if a square is even, the number itself cannot be odd. That is the fact used in the proof above.

Key terms · tap one for its definition

proof by contradiction

A proof by contradiction is a proof that assumes a statement is false and shows this assumption leads to an impossibility.

rational number

A rational number is a number that can be written as a fraction of two integers with a non-zero denominator.

irrational number

An irrational number is a number that cannot be written as a fraction of two integers.

Part 5 done

6

Part 6 of 6: Each method suits a particular kind of statement

With four methods available, the form of the statement guides your choice. The table sets out when each one fits.

Choosing a proof method

MethodUse it whenWhat it shows
DeductionA general algebraic result is claimedTrue for all cases
ExhaustionThe cases are few and can be listedTrue in every case
Counter-exampleA claim looks falseThe claim is false
ContradictionA direct proof is hard, as with irrationalsThe opposite is impossible
Method
Deduction
Use it when
A general algebraic result is claimed
What it shows
True for all cases
Method
Exhaustion
Use it when
The cases are few and can be listed
What it shows
True in every case
Method
Counter-example
Use it when
A claim looks false
What it shows
The claim is false
Method
Contradiction
Use it when
A direct proof is hard, as with irrationals
What it shows
The opposite is impossible

Exam tip

Name your method and finish with a clear conclusion in words. Both make your argument easy to follow.

Note read

Check your recall[14 marks]

6 written questions. Answer each one in your head or on paper, then open the mark scheme.

  1. 1.State[1 mark]

    State why testing a few numbers does not prove a general statement.

    Show mark schemeHide mark scheme

    Model answer

    Checking a few numbers covers only some cases, so it cannot show the statement holds for every case.

    • 1 mark for stating that checking a few cases does not cover every case
  2. 2.Show[3 marks]

    Show that the sum of any two consecutive odd integers is a multiple of 4.

    Show mark schemeHide mark scheme

    Model answer

    Let the integers be 2n+12n+12n+1 and 2n+32n+32n+3. Their sum is 4n+4=4(n+1)4n+4=4(n+1)4n+4=4(n+1). Since n+1n+1n+1 is an integer, the sum is a multiple of 4.

    • 1 mark for writing two consecutive odd integers as 2n+12n+12n+1 and 2n+32n+32n+3
    • 1 mark for simplifying the sum to 4n+44n+44n+4
    • 1 mark for factorising to 4(n+1)4(n+1)4(n+1) and concluding that it is a multiple of 4
  3. 3.Give[2 marks]

    Give a counter-example, with working, to the statement ‘n2>nn^2>nn2>n for every integer nnn’.

    Show mark schemeHide mark scheme

    Model answer

    Take n=1n=1n=1. Then n2=1n^2=1n2=1, which is not greater than n=1n=1n=1, so the statement is false.

    • 1 mark for choosing a valid integer such as n=1n=1n=1 or n=0n=0n=0
    • 1 mark for showing that the inequality fails for that value
  4. 4.Explain[2 marks]

    Explain why checking one even case and one odd case completes a proof by exhaustion for a statement about all integers.

    Show mark schemeHide mark scheme

    Model answer

    Every integer is either even or odd, so the two cases cover every possibility. If the statement is true in both cases, it is true for all integers.

    • 1 mark for stating that every integer is even or odd, so the cases are complete
    • 1 mark for concluding that the statement is true for every integer when it holds in both cases
  5. 5.Describe[3 marks]

    Describe how to begin a proof by contradiction that 2\sqrt{2}2​ is irrational.

    Show mark schemeHide mark scheme

    Model answer

    Assume 2\sqrt{2}2​ is rational. Write it as ab\frac{a}{b}ba​, where aaa and bbb are integers with no common factor. Square both sides to get a2=2b2a^2=2b^2a2=2b2.

    • 1 mark for assuming that 2\sqrt{2}2​ is rational
    • 1 mark for writing 2=ab\sqrt{2}=\frac{a}{b}2​=ba​ with integers aaa and bbb having no common factor
    • 1 mark for squaring to obtain a2=2b2a^2=2b^2a2=2b2
  6. 6.Show[3 marks]

    Show that the product of two odd integers is odd.

    Show mark schemeHide mark scheme

    Model answer

    Let the integers be 2m+12m+12m+1 and 2n+12n+12n+1. Their product is 4mn+2m+2n+1=2(2mn+m+n)+14mn+2m+2n+1=2(2mn+m+n)+14mn+2m+2n+1=2(2mn+m+n)+1. This is one more than an even number, so it is odd.

    • 1 mark for writing two odd integers as 2m+12m+12m+1 and 2n+12n+12n+1
    • 1 mark for expanding to 4mn+2m+2n+14mn+2m+2n+14mn+2m+2n+1
    • 1 mark for factorising to 2(2mn+m+n)+12(2mn+m+n)+12(2mn+m+n)+1 and concluding that it is odd

Practice this topic

10 quick-fire multiple-choice questions, easy to hard. Tap an answer to see if you're right and the worked explanation. (The written questions with mark schemes are under “Check your recall” above.)

0 right0 of 10 answered

Includes the 2 quick checks in the note above.

3.

Easy·Identify[1 mark]

Identify the method that assumes a statement is false and reaches an impossible result.
Show answer and explanation

Answer: C · Worked explanation

Proof by contradiction assumes the opposite of the claim and shows this leads to something impossible, so the claim must be true. Proof by exhaustion is different: it checks every case in a finite list and never assumes the claim is false. Deduction works forwards from known facts.
4.

Medium·Identify[1 mark]

Identify the value of nnn that is a counter-example to the statement ‘n2+n+11n^2+n+11n2+n+11 is prime for every positive integer nnn’.
Show answer and explanation

Answer: D · Worked explanation

For n=10n=10n=10, 102+10+11=121=11×1110^2+10+11=121=11\times11102+10+11=121=11×11, which is not prime. For n=3n=3n=3, n=5n=5n=5 and n=7n=7n=7 the expression gives 23, 41 and 67. All three are prime, so those values support the statement rather than disprove it. One failing value is all a counter-example needs, so there is no need to test further integers.
5.

Medium·Determine[1 mark]

Determine which description is true of the sum of three consecutive even integers 2n2n2n, 2n+22n+22n+2 and 2n+42n+42n+4, where nnn is an integer.
Show answer and explanation

Answer: B · Worked explanation

Adding gives 2n+(2n+2)+(2n+4)=6n+6=6(n+1)2n+(2n+2)+(2n+4)=6n+6=6(n+1)2n+(2n+2)+(2n+4)=6n+6=6(n+1), which is always a multiple of 6. A multiple of 12 is wrong: 2+4+6=122+4+6=122+4+6=12 works, but 4+6+8=184+6+8=184+6+8=18 does not. A multiple of 4 is also wrong, because 18 is not divisible by 4. A quick check with n=1n=1n=1 gives 2+4+6=122+4+6=122+4+6=12, which is indeed a multiple of 6.
6.

Medium·Identify[1 mark]

Identify the statement that can be disproved by a single counter-example.
Show answer and explanation

Answer: B · Worked explanation

The number 2 is prime and even, so it is a counter-example to ‘every prime number is odd’. The other three statements are true for all integers, so no counter-example exists. Checking a few examples would not settle them, and they need a proof.
7.

Medium·Determine[1 mark]

A proof that n2+nn^2+nn2+n is even uses the cases n=2kn=2kn=2k and n=2k+1n=2k+1n=2k+1. Determine the simplified value of n2+nn^2+nn2+n when n=2k+1n=2k+1n=2k+1.
Show answer and explanation

Answer: A · Worked explanation

Expand (2k+1)2=4k2+4k+1(2k+1)^2=4k^2+4k+1(2k+1)2=4k2+4k+1 and add 2k+12k+12k+1 to get 4k2+6k+24k^2+6k+24k2+6k+2, which equals 2(2k2+3k+1)2(2k^2+3k+1)2(2k2+3k+1) and so is even. The value 2k2+3k+12k^2+3k+12k2+3k+1 is only the factor left after taking out 2, not the value of n2+nn^2+nn2+n. Always check each case by substituting back, and write the final line as 2 times an integer.
8.

Hard·Identify[2 marks]

A student checks that n2+n+11n^2+n+11n2+n+11 is prime for n=1,2,…,9n=1,2,\dots,9n=1,2,…,9 and says this proves it is prime for all positive integers nnn. Identify the correct comment.
Show answer and explanation

Answer: B · Worked explanation

A list of true cases cannot prove a claim for infinitely many integers. Here n=10n=10n=10 gives 100+10+11=121=11×11100+10+11=121=11\times11100+10+11=121=11×11, so the statement is false. Calling nine cases a proof by exhaustion is wrong, because exhaustion needs the cases to cover every possibility.
9.

Hard·Determine[2 marks]

Determine which statement is true for every integer nnn.
Show answer and explanation

Answer: A · Worked explanation

The expression n2+nn^2+nn2+n is always even, as the case-by-case proof shows, so adding 1 always gives an odd number. Taking n=2n=2n=2 rules out the other statements. Here n2+n=6n^2+n=6n2+n=6 is even rather than odd, n2+1=5n^2+1=5n2+1=5 is not even, and n2−n+1=3n^2-n+1=3n2−n+1=3 is not even.
10.

Hard·Identify[2 marks]

In the proof that 2\sqrt{2}2​ is irrational, with 2=ab\sqrt{2}=\frac{a}{b}2​=ba​ in lowest terms, identify the fact that creates the contradiction.
Show answer and explanation

Answer: A · Worked explanation

The working shows a2=2b2a^2=2b^2a2=2b2, then that aaa is even, then that bbb is even. Two even numbers share the factor 2, which contradicts the assumption that ab\frac{a}{b}ba​ is in lowest terms. Having a2a^2a2 even is not itself a contradiction, because it is only one step in the working.

Keep going

Next topicP2 Algebra and functions

More in P · Pure mathematics

  1. P1ProofNotes · 10 questions
  2. P2Algebra and functionsNotes · 10 questions
  3. P3Coordinate geometryNotes · 10 questions
  4. P4Sequences and seriesNotes · 10 questions
  5. P5TrigonometryNotes · 10 questions
  6. P6Exponentials and logarithmsNotes · 10 questions
  7. P7DifferentiationNotes · 10 questions
  8. P8IntegrationNotes · 10 questions
  9. P9Numerical methodsNotes · 10 questions

All Edexcel A-level Mathematics topics →

Draft: written by Scribe and checked automatically, not yet by a subject reviewer.

Practice questions are original, written by Scribe and checked automatically for correctness.

Topic codes follow the official numbering. Not endorsed by Pearson Edexcel or any exam board.

On this page

0/6 read

  1. 1A proof by deduction shows a result holds for every case
  2. 2Algebraic proofs finish by showing the required form
  3. 3Proof by exhaustion checks every possible case
  4. 4A single counter-example disproves a statement
  5. 5Proof by contradiction assumes the opposite and fails
  6. 6Each method suits a particular kind of statement
  7. Check your recall
  8. Practice: 10 questions
All coursesScribeHow it worksPricingPrivacyTerms

Notes and questions are written by Scribe in our own words. Topic codes follow the official course numbering so you can find your place. Not produced or endorsed by the IB, College Board, AQA, OCR, Pearson Edexcel or any exam board.

© 2026 Scribe