Not sure which lesson to do first? Find your level and get a plan →

Math · Sets & Logic · Grade 9-12

Proof Techniques

Proof techniques are the named strategies for establishing a mathematical claim: pick direct proof, contradiction, contrapositive, cases, or induction based on the claim's structure and what you are given.


Quick Answer

Proof techniques are the named strategies for establishing a mathematical claim: pick direct proof, contradiction, contrapositive, cases, or induction based on the claim's structure and what you are given. Read the claim's form before writing anything. An if-then with a usable hypothesis suggests a direct proof; "there is no…" or "is irrational" suggests contradiction; a statement about every integer n≥1 that builds step by step suggests induction; and a claim that splits naturally, such as even and odd n, suggests cases.

Why This Matters

The right technique often makes a proof a few lines long, and the wrong one can make it impossible to finish: trying to show 2 is irrational directly gives you nothing to start from, while assuming it is a fraction hands you an equation. Choosing on purpose also helps when you are stuck, because when one approach stalls you know which others to try.

Intuitive Explanation

Different claims have different shapes, and each shape has a tool that grips it. "If n is a multiple of 6, then n is even" hands you something to work with: n=6k, so n=2(3k), and forward reasoning finishes it in one line. That is a direct proof. "There is no largest prime" gives you nothing to start from, but its opposite, "there is a largest prime p", is concrete enough to attack, so contradiction fits. "2n≥n+1 for every integer n≥1" is a ladder of claims, each built from the last, which is the shape induction is made for.

Two more tools handle shapes the first three don't. The contrapositive replaces "if n2 is odd, then n is odd" with the equivalent "if n is even, then n2 is even", which has a usable starting point. Proof by cases splits a claim into pieces you can handle one at a time: to show that n2 leaves remainder 0 or 1 when divided by 4, take n=2k, giving 4k2, and n=2k+1, giving 4(k2+k)+1.

The technique is a plan, not the proof. Saying "use induction" earns nothing until the base case and the step are written out. Surface features can mislead, too: a letter n does not mean induction. "If n is even, then n2 is even" is about one arbitrary n, with no chain from case to case, so a direct proof is the natural fit. Choose by what the claim says, not by which letters it uses.

Think of it like this. Proof techniques are keys on a ring, and the claim is the lock. You don't try the same key in every lock; you look at the keyhole first: an if-then keyhole, a "there is no" keyhole, a "for every n" keyhole. Unlike real locks, a claim sometimes opens with two different keys, and then the shorter proof wins.

Core idea. Proof techniques are the menu of standard strategies — direct, contradiction, contrapositive, induction, cases — and the skill is choosing the one that fits the statement you must establish.


When to Use

Use this when a problem says prove, before you write anything: rewrite the claim as "if… then…", "there is no…" or "for every n…". Then match the form. An if-then with a usable hypothesis calls for a direct proof; a negation that is easier to handle calls for contradiction or the contrapositive; every integer n built step by step calls for induction; a natural split such as even and odd calls for cases. To show a claim is false, you need no technique, only one counterexample.

Tip. Ask: Have I matched the strategy to the claim's form before starting to write the proof?

How to Recognize It

Before choosing a technique, look at what the claim hands you to work with and what it asks you to reach.

  1. Does the hypothesis give you something you can write as an equation, such as n=2k or b=ak?

    If yes, start with a direct proof and work forward to the conclusion's definition. If the hypothesis gives nothing concrete but the negated conclusion does, consider the contrapositive.

  2. Does the claim say that something is impossible, does not exist or is irrational?

    If yes, proof by contradiction usually fits, because assuming the opposite gives you an object to examine, such as a largest prime or a fraction ab. A positive claim with a usable hypothesis is cleaner as a direct proof.

  3. Is the claim about every integer from a starting value, with each case built from the one before?

    If yes, use mathematical induction, or strong induction when a case needs several earlier ones. If the claim is about one arbitrary integer with no chain between cases, a direct proof is enough.

  4. Does the claim split into a few kinds of input that behave differently, such as even and odd, or positive and negative?

    If yes, prove each case separately and note that the cases cover every possibility. If you are asked to show a claim is false, you need no technique at all, only one counterexample.

Proof Techniques compared with Direct proof, Proof by contradiction, and Mathematical induction

The rows are one menu and three items on it, which is why the general idea gets confused with each specific one. Ask whether you are still deciding which road to take or already travelling one particular road.

Proof Techniques

Meaning
Use this when you face a 'prove that' task and must decide which proof strategy fits the claim's structure before writing the argument.
Key test
Have I matched the strategy to the claim's form before starting to write the proof?
Example
You must prove: 'For every integer n≥1, 1+2+⋯+n=n(n+1)2.' Which technique fits?

Direct proof

Meaning
One specific technique: assume the hypothesis and chain forward to the conclusion.
Key test
Use when the claim is 'if P then Q' and P gives you something concrete to build on.
Formula
P⇒Q
Example
Assume n is even, show n2 is even

Proof by contradiction

Meaning
One specific technique: assume the claim is false and derive an impossibility.
Key test
Use for 'there is no...', irrationality, or when the negation is easier to work with.
Formula
Assume ¬P, derive ⊥
Example
Assume 2 is rational, reach a contradiction

Mathematical induction

Meaning
One specific technique: prove a base case and that each case forces the next.
Key test
Use for claims 'for all integers n≥n0' with a self-referential structure.
Formula
Base case + inductive step
Example
Prove 1+2+⋯+n=n(n+1)2 for all n

Formula & Notation

Worked Examples

Example 1 — Choose the technique

Easy

You must prove: 'For every integer n≥1, 1+2+⋯+n=n(n+1)2.' Which technique fits?
Show the steps and the answer
  1. Read the form: "for every integer n≥1", one claim for each of n=1,2,3,…

    Infinitely many claims indexed by an integer are the first sign of induction.

  2. See how neighbouring cases connect: the sum up to n+1 is the sum up to n plus (n+1).

    Each case is built from the one before, so a step from n to n+1 comes naturally.

  3. Try the first case: n=1 gives 1=1⋅22, which is true.

    Induction needs a starting case that holds, and this one does.

  4. Sketch the step: assuming the total up to n is n(n+1)2, adding n+1 gives n(n+1)+2(n+1)2=(n+1)(n+2)2, the formula for n+1.

    The step closes cleanly, which confirms the choice before the full proof is written.

Answer: Use induction

Takeaway: "For every integer n" plus a quantity that grows by one term at a time is the shape induction is built for.

Example 2 — Looks like induction, is direct

Standard

Prove: 'If n is an even integer, then n2 is even.' Does the integer n mean you need induction?
Show the steps and the answer
  1. Read the form: "if n is even, then n2 is even", a single if-then about any even n.

    Nothing links the case n=4 to the case n=6, so there is no chain for induction to climb.

  2. Check whether the hypothesis gives a foothold: "even" means n=2k for an integer k.

    A hypothesis that turns into a formula is the sign that forward reasoning will work.

  3. Carry it out: n2=(2k)2=4k2=2(2k2), which is 2 times an integer.

    One line of algebra finishes the proof, confirming that the direct route was the right pick.

Answer: Direct proof, not induction

Takeaway: An integer variable alone does not call for induction; an if-then whose hypothesis unpacks into a formula calls for a direct proof.

Example 3 — Find the mistake: a needless contradiction

Application

Prove that the sum of two multiples of 5 is a multiple of 5. Jamal writes: "Suppose 5a+5b is not a multiple of 5. But 5a+5b=5(a+b), which is a multiple of 5. Contradiction, so the claim is true." Find the mistake in his choice of technique and correct it.
Show the steps and the answer
  1. Find the line that does the work: 5a+5b=5(a+b).

    That line never uses the assumption "suppose it is not a multiple of 5"; it proves the claim on its own.

  2. Delete the wrapper: remove "suppose…" and "contradiction" and read what is left.

    If deleting the assumed negation leaves a complete argument, the proof was direct all along.

  3. Write it directly: "Let the numbers be 5a and 5b with a,b integers. Then 5a+5b=5(a+b), and a+b is an integer, so the sum is a multiple of 5."

    The direct version is shorter and shows why the claim is true, not only that its opposite fails.

  4. Test with numbers: 15+40=55=5(3+8).

    The general form matches a specific case, as it must.

Answer: A direct proof: 5a+5b=5(a+b) is a multiple of 5. The contradiction framing added nothing.

Takeaway: If the negation you assumed is never used, you didn't need contradiction; write the forward argument instead.

Where You'll See It

  • Proving a program's loop is correct

    Programmers check loops with a loop invariant, which is induction in disguise: show a statement is true before the first pass and that each pass keeps it true. For a loop adding 1 to 100, "total equals the sum of the numbers added so far" starts at 0 and stays true, so after pass 100 the total is 5050.

  • A tiling puzzle with no solution

    Can 31 dominoes cover a chessboard with two opposite corners removed? Assume they can. Each domino covers one black and one white square, so 31 dominoes cover 31 of each. But opposite corners share a colour, leaving 30 of that colour and 32 of the other. Contradiction, so it is impossible.

Common Mistakes

  1. The slip: Defaulting to one favorite technique for every problem

    Instead: read the claim's structure first; the form tells you which tool fits.

  2. The slip: Confusing the technique (the strategy) with the proof (the executed argument)

    Instead: the technique is your choice of road, not the trip itself.

  3. The slip: Picking contradiction when direct proof works

    Instead: prefer the most direct route; only assume the negation when forward reasoning has no foothold.


Mini Practice

Try these on your own. Tap Reveal when you want to check.

  1. Choose a technique and prove: if a and b are multiples of 5, then a+b is a multiple of 5.

    Hint: Can you start from the hypothesis and simply move forward?

  2. Choose a technique and prove: "There is no largest even number."

    Hint: It is hard to start from "no largest". What happens if you suppose there is one?

  3. Claim: "For every integer n≥1, 3n−1 is even." Induction would work, but is there a shorter technique? Prove it.

    Hint: Is 3n odd or even?

  4. Prove that 2+4+6+⋯+2n=n(n+1) for every n≥1. Which technique fits, and what is the key step?

    Hint: The sum grows one term at a time. Assume it holds for n and add the next term.

  5. Claim A: "For all n≥1, 3+7+11+⋯+(4n−1)=n(2n+1)." Claim B: "If n is a multiple of 4, then n is even." Which needs induction and which a direct proof?

    Hint: Which claim is built up step by step from the case before it?

  6. To prove "if x=3, then 2x+1=7", Ray writes: "Assume x=3 and 2x+1≠7..." and hunts for a contradiction. Correct his approach.

    Hint: Can you simply substitute and compute forward?

Want the full set?

50 practice questions for this concept — free to try, every one with a complete worked solution showing the why, not just the answer.

Frequently Asked Questions

Can the same claim be proved by more than one technique?

Often. Take 'if n2n^2 is even, then nn is even'. A direct proof is awkward, because n2=2kn^2 = 2k does not easily tell you anything about nn. The contrapositive, 'if nn is odd, then n2n^2 is odd', is quick: (2k+1)2=2(2k2+2k)+1(2k + 1)^2 = 2(2k^2 + 2k) + 1. Contradiction also works, by supposing n2n^2 is even and nn is odd. Most people choose the contrapositive here because it is shortest.

What is the contrapositive, and why is proving it allowed?

The contrapositive of 'if PP then QQ' is 'if not QQ then not PP'. The two are always true or false together: 'if it is a square, it is a rectangle' and 'if it is not a rectangle, it is not a square' say the same thing. The converse, 'if it is a rectangle, it is a square', is a different claim, and here it is false. So proving the contrapositive proves the original.

What is proof by cases, and how does it go wrong?

You split the possible inputs into groups that together cover everything, then prove the claim in each group. To show ∣xy∣=∣x∣∣y∣|xy| = |x||y|, for example, take cases by the signs of xx and yy. It goes wrong when a case is missed: a proof that handles x>0x > 0 and x<0x < 0 but forgets x=0x = 0 is incomplete, even if the missing case is easy.

Is there a technique for showing that something exists?

Yes, two kinds. A constructive proof builds the object: to show some number lies between 13\frac{1}{3} and 12\frac{1}{2}, give their average, 512\frac{5}{12}. A non-constructive proof shows existence without naming the object, as the pigeonhole principle does: among any 13 people, two were born in the same month, though the argument never says which two.

Learning Path

Proof Techniques

You are here

Next →

Nothing after this yet
You need Proof (Intuition) (a sense of why a claim is true), Contrapositive ("if not Q then not P" is equivalent to "if P then Q") and Quantifiers ("for all" versus "there exists") first. Proof techniques add a way to choose the argument before writing it. Next you carry each one out in full, in Direct Proof, Proof by Contradiction and Mathematical Induction, and then use them in number theory and geometry.

See Also