On this concept: Formula

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

Math · Sets & Logic · Grade 9-12

Proof (Intuition)

Proof intuition is the informal but convincing sense of why a statement must hold, the insight that comes before the rigorous write-up.

(P→⊥)⇒¬P (proof by contradiction: if assuming P leads to a contradiction, then ¬P)

Quick Answer

Proof intuition is the informal but convincing sense of why a statement must hold, the insight that comes before the rigorous write-up. You use it when you need to understand why a claim holds in every case, not just in the cases you tried: the sum of two even numbers is even because two piles of pairs combine into one pile of pairs. That forcing reason tells you which proof to write and makes the formal steps feel inevitable. Without it you are left collecting examples, which prove nothing general, or pushing symbols you cannot steer.

Why This Matters

Examples can mislead badly: n2−n+41 gives primes for n=1 to 40 and fails at 41. A forcing reason is what separates 'it has worked so far' from 'it cannot fail'. It also makes formal proofs findable: once you see why 2 cannot be a fraction, because its top and bottom would both have to be even forever, the written proof by contradiction almost writes itself.

Intuitive Explanation

Why is the sum of two odd numbers always even? Picture each odd number as pairs of dots with one dot left over. Put two odd numbers together and the two leftover dots pair up with each other, so nothing is left over and the total is even. That picture does not depend on which odd numbers you chose, so it covers 3+5, 101+999, and every pair you will never get round to checking. That is proof intuition: a reason that forces the conclusion in every case at once.

In symbols the same idea reads: odd numbers are 2a+1 and 2b+1, and their sum is 2a+2b+2=2(a+b+1), a multiple of 2. The algebra is the formal proof; the leftover dots are the intuition that told you which algebra to write. Good proofs usually start this way, with a picture, a pairing or an 'if it were false, then...' story, and only afterwards get written up.

A pile of examples can feel similar but is a different thing. Checking 3+5=8, 7+9=16 and 11+13=24 makes the claim plausible, not forced; nothing in those checks explains why the next case must behave. A useful test is to ask whether your reason mentions anything special about the cases you tried. If it does not, it is a candidate proof. If all you have is 'it worked every time', you have a conjecture.

Think of it like this. Proof intuition is knowing why a bridge stands, not just that it has stood for years. The record of quiet years is the pile of examples; understanding how the load travels through the arches is the forcing reason, and only that tells you what will happen under a load the bridge has never carried.

Core idea. Proof intuition is the convincing 'aha' chain that something cannot fail to be true, which then guides a formal proof.


When to Use

Look for a forcing reason when a problem asks you to show, prove or explain why something is always true, or when a pattern has held in every case you checked and you need to know whether it must continue. Try a picture (dots, areas, pairs), a general form such as 2a+1 for an odd number, or imagine the claim failing and see what breaks. If you suspect the claim is false, hunt for a counterexample; once the reason is clear, write the formal proof.

Tip. Ask: Do I have a chain of reasoning that forces the conclusion, beyond just examples that happen to work?

How to Recognize It

Before writing a proof, try to say in one or two plain sentences why the claim cannot fail, using a picture, a pairing or a general form rather than a list of cases.

  1. Can you explain why the claim holds for a case you have never tested?

    If yes, you have a forcing reason: an odd number is pairs plus one spare, so two odd numbers leave two spares, which form one more pair, making the sum even. If you can only list cases that worked, you have a conjecture.

  2. Does the claim survive the strange cases, such as n=1, zero, negatives or the prime 2?

    If one of them fails, stop looking for a reason and report a counterexample. If they all pass and you still cannot see why, keep searching for a reason rather than piling up more checks.

  3. Does your reason use a general form, such as 2a+1 for any odd number, rather than particular numbers?

    If yes, it covers every case at once and can become a proof. A reason that uses only 3, 5 and 7, however convincing, describes those three numbers and nothing more.

  4. Is every step already justified from definitions, so that a sceptical reader could check it line by line?

    If yes, you have gone beyond intuition to a formal proof. Intuition is the plan that tells you which steps to write; the formal proof is the written argument someone else can verify.

Proof (Intuition) compared with Counterexample, Conjecture, and Formal proof

All four rows sit between a hunch and a certainty. Ask how far along you are: a guess backed by cases (conjecture), a reason it must hold (proof intuition), a written argument anyone can check (formal proof), or a case showing it fails (counterexample).

Proof (Intuition)

Meaning
Use this when you need to discover or motivate why a statement must be true so you know which proof to write, not yet to write the formal proof.
Key test
Do I have a chain of reasoning that forces the conclusion, beyond just examples that happen to work?
Formula
(P→⊥)⇒¬P (proof by contradiction: if assuming P leads to a contradiction, then ¬P)
Example
Why must the sum of two even numbers be even?

Counterexample

Meaning
A single case that shows a claim is false, ending any attempt to prove it.
Key test
Use when you suspect a statement is false and want to disprove it outright.
Example
One odd number that isn't prime kills 'all odds are prime'

Conjecture

Meaning
A statement believed true from patterns but not yet justified by an argument.
Key test
Use to name a guess before any intuition for why it holds exists.
Example
Goldbach: every even number > 2 is a sum of two primes

Formal proof

Meaning
The fully rigorous, axiom-based written argument that intuition motivates.
Key test
Use when discovery is done and the argument must be airtight for a reader.
Formula
∴…■
Example
Writing out the irrationality of 2 line by line

Formula & Notation

(P→⊥)⇒¬P (proof by contradiction: if assuming P leads to a contradiction, then ¬P)
Direct: assume P, derive Q. Contradiction: assume ¬Q, derive ⊥, conclude Q. Contrapositive: prove ¬Q→¬P instead of P→Q

How to read it: ∴ means 'therefore'; □ or ■ marks the end of a proof (QED)

Worked Examples

Example 1 — Sum of two evens

Easy

Why must the sum of two even numbers be even?
Show the steps and the answer
  1. Picture an even number as dots arranged in pairs with none left over, such as 6 as three pairs.

    'Even' means exactly this: the number splits into twos with nothing remaining.

  2. Put two such piles of pairs together.

    Joining pairs to pairs creates no leftover dot, so the combined pile is still made entirely of pairs.

  3. Translate into symbols: the evens are 2a and 2b, and 2a+2b=2(a+b).

    Twice a whole number is even, and a+b is a whole number whatever a and b are.

  4. Check that the reason used nothing special: it works for 4+10, for 0+0 and for 1000+2 alike.

    The argument never relied on particular values, which is what makes it a proof and not an example.

Answer: It must be even

Takeaway: A reason that works without knowing which numbers you picked covers every case at once. Pictures of pairs often supply that reason for even and odd facts.

Example 2 — Pattern that fools you

Standard

You notice n2−n+41 is prime for n=1,2,3,…,40. Does the pattern prove it's always prime?
Show the steps and the answer
  1. Plug in the next value: 412−41+41=412=1681.

    Testing just beyond the checked range is cheap, and here the result is not prime.

  2. Factor: 1681=41⋅41, so the claim 'always prime' is false.

    One failing value disproves a statement about every n.

  3. Ask what the forty successes rested on: nothing in them explained why the next value had to be prime.

    Without a forcing reason, a run of cases is a pattern, not a proof.

  4. Spot the break by structure: at n=41 each term, n2, −n and 41, is a multiple of 41.

    Asking whether some n makes every term share a factor finds the failure without checking forty cases first.

Answer: No — it fails at n=41

Takeaway: Many confirming cases, even forty, do not prove a claim. Look for a reason that works for every n, or for a value where the structure breaks.

Example 3 — Find the mistake: examples instead of a reason

Application

Show that the product of any two consecutive whole numbers is even. Kim writes: "1⋅2=2, 2⋅3=6, 3⋅4=12 and 10⋅11=110 are all even, so it is always true." Find the mistake and correct it.
Show the steps and the answer
  1. Identify what Kim has: four confirming examples.

    Examples make the claim plausible, but they cover only four of infinitely many pairs.

  2. Find the forcing reason: of two consecutive whole numbers n and n+1, one is even, because even and odd numbers alternate.

    This fact holds for every n, not just the ones checked.

  3. Finish the argument: if n=2k, then n(n+1)=2k(n+1); if n+1=2k, then n(n+1)=2kn. Either way the product has a factor of 2.

    Any whole number with a factor of 2 is even.

  4. Try the reason on a case Kim did not check: 57⋅58=3306, and 58 is the even factor.

    The reason predicts which factor supplies the 2, something a list of examples cannot do.

Answer: The product is always even, because one of any two consecutive whole numbers is even; Kim's examples alone did not show this.

Takeaway: Replace 'it worked every time' with 'it must work because...'. Here the alternation of even and odd numbers is the reason that covers every case.

Where You'll See It

  • Why barcodes catch typing errors

    An ISBN-13 check digit makes the weighted sum of the digits, with weights alternating 1 and 3, a multiple of 10. Changing one digit by d (from 1 to 9) changes the sum by d or 3d, and neither is ever a multiple of 10. That reason guarantees every single-digit typo is caught, without testing millions of cases.

  • Counting handshakes at a party

    However a party goes, the number of guests who shook an odd number of hands is always even. Each handshake adds 2 to the total of everyone's counts, so that total is even, and an even total cannot contain an odd number of odd counts.

  • A chessboard dominoes cannot cover

    Cut two opposite corners off a chessboard, leaving 62 squares, and try to cover it with 31 dominoes. It cannot be done: both removed corners are the same colour, leaving 32 squares of one colour and 30 of the other, while every domino covers one of each.

Common Mistakes

  1. The slip: Accepting a pile of confirming examples as the intuition

    Instead: verify you have a reason that applies to ALL cases, not just the ones you tried.

  2. The slip: Writing formal proof symbols before you can say in words why it's true

    Instead: get the intuitive chain first, then formalize.

  3. The slip: Confusing intuition that the result is plausible with intuition that it's forced

    Instead: only the 'must be true' kind can become a proof.


Mini Practice

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

  1. Why must the product of any two odd numbers be odd? Give the intuition, then check it with 7×9.

    Hint: An odd number is some pairs plus one leftover. What happens to the leftovers when you multiply?

  2. Why is the sum of any 5 consecutive integers a multiple of 5? Test it with 8 to 12, then explain.

    Hint: Call the middle number m. How do the numbers on either side balance?

  3. Why must 1,236 be divisible by 3, given that its digits add to 12? Explain why the digit-sum test works.

    Hint: Write 10=9+1 and 100=99+1. What is left after removing multiples of 9?

  4. In any group of 13 people, at least two share a birth month. Why must this be true, not just likely?

    Hint: How many months are there to put people into?

  5. Lia checks that 2n>n2 for n=5,6,7,8 and feels sure it holds for all n≥5. Is that a forcing intuition or only a conjecture?

    Hint: What happens to each side when n goes up by 1?

  6. Max says: "The sum of two primes is always even, since 3+5, 7+11 and 13+17 are all even." Correct him.

    Hint: His examples share a feature. Is there a prime without it?

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 a picture count as a proof?

Sometimes, if the picture shows a reason that works for every size. Two copies of the staircase 1+2+⋯+n1 + 2 + \cdots + n fit together into an nn by n+1n + 1 rectangle, which shows the sum is n(n+1)2\frac{n(n + 1)}{2} for any nn. But pictures can mislead: the famous missing-square puzzle rearranges four pieces into a shape that seems to lose one unit of area, because two slopes that look equal are not.

Why do mathematicians want a proof when a computer has checked millions of cases?

Because some claims fail only at enormous numbers. In 1919 George Pólya guessed that for every n>1n > 1, at least half the numbers from 1 to nn have an odd count of prime factors, counting repeats. It holds for every nn up to 906,150,256 and fails at 906,150,257, a value located only in 1980. A forcing reason covers all nn; checking never can.

Why does proof by contradiction work?

It relies on a statement being either true or false. To show 2\sqrt{2} is irrational, suppose it equals a fraction ab\frac{a}{b} in lowest terms. Squaring gives a2=2b2a^2 = 2b^2, so aa is even; writing a=2ca = 2c gives b2=2c2b^2 = 2c^2, so bb is even too, which breaks 'lowest terms'. The supposition led to something impossible, so it was false, and 2\sqrt{2} is irrational.

Learning Path

Proof (Intuition)

You are here

You need Logical Statement and Conditional Statement first: claims that are true or false, and the 'if P then Q' form that a proof connects. Proof intuition adds the search for a reason that forces the conclusion in every case, not just the ones you checked. Next, Contrapositive gives another route, proving 'if not Q then not P', and Counterexample shows how a single case can sink a claim.

See Also