GLRC 2026
Participate Home Rounds Awards Training Blog FAQ
Resources Resources Support

What Is a Counterexample in Math?

Blog › Logic And Reasoning Explained

· by Julia Berens · 4 min read

A hand marks a checklist in a cream notebook at a computer workstation, with blue-green monitors and a softly glowing keyboard.

If you have ever asked, “What is a counterexample in math?” start with this claim: “Every prime number is odd.” The number 2 disproves it. The only positive divisors of 2 are 1 and 2, so it is prime. But 2 is even, not odd. A counterexample does both jobs: it meets the conditions of the claim and fails to meet its conclusion.

What is a counterexample in math, exactly?

A universal statement makes a claim about every case in a specified group. The words every, all, and for each often signal that kind of statement. Sometimes the wording is shorter. “Multiples of 6 are even” means that every multiple of 6 is even, even though the word every does not appear.

To test a claim of this kind, separate it into two parts: what qualifies a case for consideration, and what the statement says must be true of each qualifying case. For “Every prime number is odd,” the condition is being prime and the conclusion is being odd. The number 2 meets the first test and fails the second.

The number 9 illustrates a different outcome. It is odd, but it is not prime. That does not contradict the claim. The statement makes a promise about primes, not about all odd numbers. To decide whether 9 matters, you have to read the claim in the right direction.

Why one case outweighs any number of matches

Suppose someone says, “For every positive integer n, n2 is greater than n.” Testing 2, 3, and 4 gives 4 > 2, 9 > 3, and 16 > 4. Those calculations are all correct. They show that the inequality works for those three inputs, not that it works for every allowed input.

Now try 1. It is a positive integer, so the claim includes it. But 12 = 1, and 1 is not greater than itself. The claim does not say “greater than or equal to.” Equality is enough to make the stated conclusion false.

The matching cases still count as correct calculations. They just cannot rescue the word every. By contrast, if the group is finite and you check each member without missing any, that can prove a universal claim about that group. The issue is not that checking examples is always insufficient. It is that checking only some cases leaves the others unsettled.

A near miss can have flawless arithmetic

For the same inequality claim, consider n = 1/2. Squaring gives (1/2)2 = 1/4, which is less than 1/2. That looks like an even stronger objection than equality at 1. The arithmetic is right, but the objection fails: 1/2 is positive without being an integer. The claim does not make any promise about it.

Zero is another near miss. It is an integer and 02 = 0, but it is not positive. A case has to meet all the conditions, not just the one that is easiest to check. The three candidates fail the strict inequality in different ways, but only one is eligible to disprove the original statement.

CandidatePositive integer?Is its square greater?Counterexample?
1/2NoNoNo
0NoNoNo
1YesNoYes

Change “positive integers” to “positive real numbers,” and 1/2 becomes a valid counterexample. Nothing about the number or the calculation has changed. What changed is the set of inputs the claim covers.

Finding and writing a counterexample

Look first at cases where the claim is most likely to fail. For a statement about positive integers, try the smallest allowed value. For a strict inequality, try to make the two sides equal. Those two leads both point to 1 in the squaring example. These are search tips, not guarantees: some claims are true, and some false claims take more work to disprove.

Once you have a candidate, write down why it qualifies before showing what goes wrong. For example, take the claim “Every positive integer divisible by 4 is divisible by 8.” A complete response is: “12 is a positive integer and is divisible by 4 because 12 = 4 × 3. But 12 is not divisible by 8 because dividing it by 8 leaves a remainder of 4.” Just writing “12” leaves the reader to supply both checks.

A counterexample can also suggest a better claim, but it does not prove the revision. For example, replacing “positive integer” with “integer greater than 1” removes the counterexample from the squaring claim. To prove the revised claim, observe that if n > 1, multiplying both sides by the positive number n gives n2 > n. The proof works because it covers every input in the revised group.

Practice with a claim about two numbers

Try this claim: “For every pair of positive integers with an even sum, both integers are even.” Consider the pairs (1, 3), (1, 2), and (2, 4). Before deciding which pair disproves the statement, mark which pairs have an even sum.

The pairs (1, 3) and (2, 4) qualify because their sums are 4 and 6. The pair (2, 4) agrees with the claim: both entries are even. The pair (1, 3) disproves it: neither entry is even. The pair (1, 2) might look useful because it contains an odd entry, but its sum is 3, so the claim does not cover it.

At the Global Logic and Reasoning Competition, checking exactly what a claim covers is one way to practice the skills described on our page about the competition. For another exercise alongside the training and practice problems, change “both integers are even” to “at least one integer is even” and write out whether (1, 3) still disproves the claim.

Frequently asked questions

Can a counterexample be more than one number?
Yes. If the claim is about pairs, a single qualifying pair can be a counterexample. A claim about all triangles can likewise be disproved by one triangle.

Can I disprove a universal claim with just one example?
Yes, if the example meets every condition but makes the conclusion false. Other examples that fit the claim do not undo that counterexample.

Does a counterexample show that the claim always fails?
No. It shows that the claim fails at least once. The conclusion can still hold in many other cases.

About the Global Logic and Reasoning Competition: an online logic and reasoning competition for high school students from around the world. How the rounds work

Written by Julia Berens, Social Media Assistant of the GLRC team.

More articles

All articles