Math · Sets & Logic · Grade 9-12 · 5 min read

Counterexample

Q: What is the fastest recognition cue for Counterexample?

Look for **disprove**, **is it always true**, **find a case where**, **for all**, but treat those words as clues, not proof. A word problem can contain a familiar keyword and still ask for a different idea. After noticing the cue, ask the recognition question: Am I trying to kill a universal claim by exhibiting one case that fits the hypothesis but breaks the conclusion? That question protects you from using a memorized procedure in the wrong place.

⚡ In one breath

A counterexample is one specific case that satisfies a claim's hypothesis yet contradicts its conclusion, disproving the general statement.

📐 The formula

\neg(\forall x\, P(x)) \Leftrightarrow \exists x\, \neg P(x)

Orient

The one-line idea, why it matters, and the intuition.

Section 1

Quick Answer

A counterexample is one specific case that satisfies a claim's hypothesis yet contradicts its conclusion, disproving the general statement. Use it when you want to show a 'for all' or 'always' claim is false — you need just one breaking instance. The cue is a universal claim you suspect is wrong and the goal of refuting, not proving, it. Before calculating, ask: Am I trying to kill a universal claim by exhibiting one case that fits the hypothesis but breaks the conclusion?

Section 2

Why This Matters

Disproving and proving are asymmetric: a universal claim needs a general proof to confirm but only one counterexample to destroy. Knowing this saves enormous effort — instead of attempting a doomed proof, you hunt the single case that breaks the claim, which is also how mathematicians sharpen conjectures. Recognizing it by "Am I trying to kill a universal claim by exhibiting one case that fits the hypothesis but breaks the conclusion?" — rather than by familiar numbers — is what lets a student tell it apart from proof and edge case and confirming example in a mixed problem set.

Section 3

Intuitive Explanation

The claim 'all primes are odd' standing tall — then you hold up the number $2$ , a prime that is even, and the whole 'for all' statement falls. This is the clean version of the idea because the visible structure matches the concept before any formula or procedure is chosen.

Offering an example that supports the claim and thinking it proves anything — a confirming case never proves a universal; only a violating case (counterexample) settles it, and then only by disproving. That contrast matters because many wrong answers come from recognizing a surface feature, such as a familiar number or word, instead of the actual task.

A useful way to slow down is to name the signal words and then test them. Words like **disprove**, **is it always true**, **find a case where**, **for all**, **show false** are helpful clues, but they are not enough by themselves. They must point to the same structure as the mental model: A counterexample is a single instance fitting the hypothesis but breaking the conclusion, which disproves a universal claim outright.

The recognition test is simple: Am I trying to kill a universal claim by exhibiting one case that fits the hypothesis but breaks the conclusion? If yes, counterexample is probably the right tool; if not, compare with Proof or Edge case or Confirming example before calculating.

Core idea

A counterexample is a single instance fitting the hypothesis but breaking the conclusion, which disproves a universal claim outright.

Recognize

The cues that signal this concept and how to distinguish it from look-alikes.

Section 4

When to Use

Use Counterexample when you want to disprove a universal 'for all' claim and a single violating instance would settle it. Strong signals include **disprove**, **is it always true**, **find a case where**, **for all**, **show false**. The safest workflow is to read the final question first, identify what kind of answer it wants, and then test the structure. Do not use counterexample just because familiar numbers appear; first decide whether the situation answers "Am I trying to kill a universal claim by exhibiting one case that fits the hypothesis but breaks the conclusion?" with yes.

✨ Pro tip

Ask: Am I trying to kill a universal claim by exhibiting one case that fits the hypothesis but breaks the conclusion?

Section 5

How to Recognize It

Before using Counterexample, check the structure of the problem, not just the vocabulary. These questions force the same recognition move from several angles: the task, the signal words, the nearest confusion, and the thing that would make the concept fail.

Am I trying to kill a universal claim by exhibiting one case that fits the hypothesis but breaks the conclusion?

If yes, the problem matches counterexample. If no, pause before applying the procedure, because the same numbers may belong to a different idea.
Which words signal the structure?

Look for disprove, is it always true, find a case where, for all. These words are useful only after the situation matches them; a keyword without structure is not proof.
What is the nearest confusion?

Proof is the common trap here: Establishes a universal claim is true for every case, the opposite goal. Compare the desired final answer before choosing a method.
What answer form should I expect?

The answer should fit this mental model: A counterexample is a single instance fitting the hypothesis but breaking the conclusion, which disproves a universal claim outright. If the expected answer sounds more like proof, use the comparison table before solving.
What would make this NOT Counterexample?

Offering an example that supports the claim and thinking it proves anything — a confirming case never proves a universal; only a violating case (counterexample) settles it, and then only by disproving. This tells you when to switch tools instead of forcing the concept.

Section 6

Counterexample vs Common Confusions

The hard part is recognizing when the task is really about counterexample instead of a nearby idea. Read the final answer the problem wants, then ask which row describes the structure before you start calculating.

Counterexample vs Common Confusions
Type	Meaning	Key test	Formula	Example
Counterexample	Use this when you want to disprove a universal 'for all' claim and a single violating instance would settle it. The deciding question is: Am I trying to kill a universal claim by exhibiting one case that fits the hypothesis but breaks the conclusion?	Am I trying to kill a universal claim by exhibiting one case that fits the hypothesis but breaks the conclusion?	$\neg(\forall x\, P(x)) \Leftrightarrow \exists x\, \neg P(x)$	Claim: 'For all integers $n$ , $n^2-n+11$ is prime.' Disprove it.
Proof	Establishes a universal claim is true for every case, the opposite goal.	Use when you must confirm a 'for all' statement, not refute it.	$\forall x\,P(x)$	Prove every even square is divisible by 4
Edge case	Probes how a formula behaves at extremes; need not disprove anything.	Use when exploring boundary behavior rather than refuting a claim.		Checking $x=0$ in $1/x$
Confirming example	A case that supports the claim, which can never prove a universal.	Use only to illustrate, never to establish a 'for all'.		$3$ is an odd prime (does not prove all are)

Counterexample

Meaning: Use this when you want to disprove a universal 'for all' claim and a single violating instance would settle it. The deciding question is: Am I trying to kill a universal claim by exhibiting one case that fits the hypothesis but breaks the conclusion?
Key test: Am I trying to kill a universal claim by exhibiting one case that fits the hypothesis but breaks the conclusion?
Formula: $\neg(\forall x\, P(x)) \Leftrightarrow \exists x\, \neg P(x)$
Example: Claim: 'For all integers $n$ , $n^2-n+11$ is prime.' Disprove it.

Proof

Meaning: Establishes a universal claim is true for every case, the opposite goal.
Key test: Use when you must confirm a 'for all' statement, not refute it.
Formula: $\forall x\,P(x)$
Example: Prove every even square is divisible by 4

Edge case

Meaning: Probes how a formula behaves at extremes; need not disprove anything.
Key test: Use when exploring boundary behavior rather than refuting a claim.
Example: Checking $x=0$ in $1/x$

Confirming example

Meaning: A case that supports the claim, which can never prove a universal.
Key test: Use only to illustrate, never to establish a 'for all'.
Example: $3$ is an odd prime (does not prove all are)

Apply

Worked examples and the mistakes most students make.

Section 7

Formula & Notation

\neg(\forall x\, P(x)) \Leftrightarrow \exists x\, \neg P(x)

\neg(\forall x\,P(x)) \Leftrightarrow \exists x_0\,\neg P(x_0)

; a single witness

x_0

with

\neg P(x_0)

refutes the universal claim

How to read it: To disprove $\forall x\, P(x)$ , exhibit a specific $x_0$ such that $\neg P(x_0)$

Section 8

Worked Examples

Example 1 — Disprove a claim

Easy

Problem

Claim: 'For all integers $n$ , $n^2-n+11$ is prime.' Disprove it.

Solution

It is a universal claim, so one violating integer is enough to kill it.

Name the structure before touching arithmetic — that is what makes the right method obvious.
Ask the recognition question: Am I trying to kill a universal claim by exhibiting one case that fits the hypothesis but breaks the conclusion?

If the answer is yes, the concept applies; the cue, not a keyword, decides the method.
Search for an $n$ where the output is composite; try $n=11$ .

The rule is chosen only after the structure matches, so the steps mean something.
$11^2-11+11=121=11\cdot 11$ , which is not prime.

Keep units, shape, or answer form tied to the story so the work does not become symbol pushing.
Check the answer against the original question.

It should fit the mental model — one failure kills 'for all'. If it does not, revisit the recognition step before changing the arithmetic.

Answer

$n=11$ is a counterexample, so the claim is false

Takeaway: One instance fitting the hypothesis but breaking the conclusion disproves any 'for all'.

Example 2 — Edge case, not counterexample

Standard

Problem

You test $n=0$ in $n^2-n+11$ and get $11$ , a prime. What did that accomplish?

Solution

Notice why this looks like the same concept.

Nearby language or numbers can tempt you toward one failure kills 'for all'.
It probed a boundary input but supported, not refuted, the claim.

Spotting what actually changed is what separates this from the concept it resembles.
Recognize this as edge-case checking; a confirming case is not a counterexample.

The nearby idea may share numbers but answers a different question, so it needs a different move.
State the result in the language of the actual task.

It proves nothing about the universal claim. Name it for what the problem really asked, not the concept you first expected.
Say the contrast in one sentence.

Counterexamples disprove; confirming or edge-case checks cannot prove a 'for all'.

Answer

It proves nothing about the universal claim

Takeaway: Counterexamples disprove; confirming or edge-case checks cannot prove a 'for all'.

Example 3 — Spot the trap: One failure kills 'for all'

Application

Problem

A student starts with this idea: "Giving a confirming example and thinking it proves the claim" What should they check before accepting that reasoning?

Solution

Pause before the first move.

The first move is a decision, not a calculation — does the situation really match one failure kills 'for all'.
Run the recognition test: Am I trying to kill a universal claim by exhibiting one case that fits the hypothesis but breaks the conclusion?

This is the single check that the trap skips.
one supporting case cannot establish a universal statement.

Stating the safer rule turns the mistake into a checkable step instead of a vague "be careful."
Compare with the nearest confusion, Proof.

Establishes a universal claim is true for every case, the opposite goal.
State the corrected decision and reuse it.

Using the concept only when the structure matches leaves a process the student can repeat on a new problem.

Answer

one supporting case cannot establish a universal statement.

Takeaway: The recognition step prevents the common trap: Giving a confirming example and thinking it proves the claim

Section 9

Common Mistakes

Common slip-up

Giving a confirming example and thinking it proves the claim

The right idea

one supporting case cannot establish a universal statement.

Common slip-up

Producing a case that fails the hypothesis

The right idea

a valid counterexample must satisfy the 'if' part and break the 'then' part.

Common slip-up

Trying to disprove a claim that was only about 'some'

The right idea

a counterexample refutes 'for all', not an existence claim.

Practice

Try it, then see where this concept fits in the path.

Section 10

Mini Practice

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

What clue tells you this is a Counterexample situation: Claim: 'For all integers $n$ , $n^2-n+11$ is prime.' Disprove it.

Hint: Am I trying to kill a universal claim by exhibiting one case that fits the hypothesis but breaks the conclusion?
Claim: 'For all integers $n$ , $n^2-n+11$ is prime.' Disprove it.

Hint: Search for an $n$ where the output is composite; try $n=11$ .
Why is this a contrast case instead of Counterexample: You test $n=0$ in $n^2-n+11$ and get $11$ , a prime. What did that accomplish?

Hint: It probed a boundary input but supported, not refuted, the claim.
Fix this thinking: Giving a confirming example and thinking it proves the claim

Hint: Name the recognition cue before choosing a rule.
Which is the better fit here: Counterexample or Proof? Explain the deciding difference.

Hint: For Counterexample, ask: Am I trying to kill a universal claim by exhibiting one case that fits the hypothesis but breaks the conclusion?
Write one sentence that would remind a classmate how to recognize Counterexample.

Hint: Use the mental model "One failure kills 'for all'." and one signal word.

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.

Practice this concept → Take a mastery check

Section 11

Frequently Asked Questions

How do I know when to use Counterexample?

Use Counterexample when you want to disprove a universal 'for all' claim and a single violating instance would settle it. Do not start from the numbers alone; first name the structure of the situation. The fastest check is: Am I trying to kill a universal claim by exhibiting one case that fits the hypothesis but breaks the conclusion? If the answer is yes and the wording matches cues like disprove, is it always true, find a case where, then counterexample is probably the right tool.

What is Counterexample most often confused with?

Counterexample is often confused with Proof. Proof means Establishes a universal claim is true for every case, the opposite goal. The difference is not just vocabulary; it changes the action you take. For counterexample, the key test is "Am I trying to kill a universal claim by exhibiting one case that fits the hypothesis but breaks the conclusion?" For proof, the better cue is: Use when you must confirm a 'for all' statement, not refute it.

What is the fastest recognition cue for Counterexample?

Look for disprove, is it always true, find a case where, for all, but treat those words as clues, not proof. A word problem can contain a familiar keyword and still ask for a different idea. After noticing the cue, ask the recognition question: Am I trying to kill a universal claim by exhibiting one case that fits the hypothesis but breaks the conclusion? That question protects you from using a memorized procedure in the wrong place.

What mistake should I avoid with Counterexample?

Avoid this thinking: "Giving a confirming example and thinking it proves the claim" That mistake usually happens when the student jumps to a rule before checking the situation. The safer version is: one supporting case cannot establish a universal statement. A good habit is to say the mental model out loud first: "One failure kills 'for all'." Then choose the calculation or representation.

How can I tell this apart from Edge case?

Edge case is the better fit when the task is about this: Probes how a formula behaves at extremes; need not disprove anything. Counterexample is the better fit when you want to disprove a universal 'for all' claim and a single violating instance would settle it. If both ideas seem possible, compare what the problem wants as the final answer. The desired output often reveals whether you should use counterexample or switch to the nearby concept.

Why does Counterexample matter?

Disproving and proving are asymmetric: a universal claim needs a general proof to confirm but only one counterexample to destroy. Knowing this saves enormous effort — instead of attempting a doomed proof, you hunt the single case that breaks the claim, which is also how mathematicians sharpen conjectures. The practical value is recognition: once you can spot counterexample, you can choose a method before calculating. That makes later topics easier because you are not memorizing isolated tricks; you are recognizing the same structure when it appears in a new representation.

Section 12

Learning Path

← Before

Quantifiers

Counterexample

You are here

Proof (Intuition)

Before this, students should be comfortable with Quantifiers. This page focuses on the recognition cue: Am I trying to kill a universal claim by exhibiting one case that fits the hypothesis but breaks the conclusion? That cue is the bridge between earlier skills and later problem solving: students first learn to identify the structure, then they learn which calculation, diagram, graph, or proof move belongs to it. After this, Proof (Intuition) become easier to recognize.

Section 13