Counterexamples and quantifiers

One counterexample disproves a "for every" statement. That much most people know. Paper 2 tests the details: whether your counterexample actually meets the conditions, what to do when there is none, and how to negate a statement with two quantifiers in it.

Facts checked on . Always confirm with the official source before you book.

Part of TMUA Paper 2. Jump to the 2 worked questions.

Rules worth writing down

  • A counterexample to "if P then Q" must make P true and Q false. A value that fails P proves nothing.
  • Sometimes the right answer is that no counterexample exists, because the statement is true.
  • The negation of "for every xx, P" is "there is an xx with not P". The negation of "there is an xx with P" is "for every xx, not P".
  • With two quantifiers, swap both and negate the inside: not (for every xx there is a yy with P) is there is an xx such that for every yy, not P.
  • The order of quantifiers matters. "For every xx there is a yy" lets yy depend on xx; "there is a yy for every xx" does not.

How it is scored

Each of the 40 questions (20 per paper) is worth one mark, and a wrong answer costs nothing, so never leave one blank. Your marks on both papers are scaled together into a single score from 1.0 to 9.0, and UAT-UK publishes no raw-mark conversion for current sittings.

When you practise with us you get an estimate on the same 1.0 to 9.0 scale, with its margin of error. How we estimate a TMUA score explains what that estimate is based on and when not to trust it.

Worked questions

Try each one before opening the answer.

Question 1 · TMUA Paper 2, counterexamples and quantifiersAim for about 3 minutes
Which value of nn is a counterexample to the following statement? "If nn is a positive integer that is not a multiple of 3, then n2+2n^2 + 2 is a multiple of 3."
  1. A: n=1n = 1
  2. B: n=2n = 2
  3. C: n=3n = 3
  4. D: n=4n = 4
  5. E: There is no counterexample.
Show the answer and the working

The answer is E.

  1. A counterexample needs nn not a multiple of 3 and n2+2n^2 + 2 not a multiple of 3.
  2. If nn is not a multiple of 3, then n=3k+1n = 3k + 1 or n=3k+2n = 3k + 2.
  3. (3k+1)2=9k2+6k+1(3k + 1)^2 = 9k^2 + 6k + 1 and (3k+2)2=9k2+12k+4(3k + 2)^2 = 9k^2 + 12k + 4. Both are one more than a multiple of 3.
  4. So n2+2n^2 + 2 is always a multiple of 3. The statement is true and there is no counterexample.

Where the other options come from

  • A. 1+2=31 + 2 = 3, a multiple of 3. It agrees with the statement.
  • B. 4+2=64 + 2 = 6, a multiple of 3.
  • C. 33 is a multiple of 3, so it does not meet the condition. It can't be a counterexample, whatever n2+2n^2 + 2 is.
  • D. 16+2=1816 + 2 = 18, a multiple of 3.
Question 2 · TMUA Paper 2, counterexamples and quantifiersAim for about 3 minutes
Which of the following is the negation of the statement "For every real number xx, there is an integer nn with n>xn > x"?
  1. A: For every real number xx, there is an integer nn with n≤xn \le x.
  2. B: There is a real number xx such that n≤xn \le x for every integer nn.
  3. C: For every real number xx, every integer nn has n≤xn \le x.
  4. D: There is a real number xx and an integer nn with n≤xn \le x.
  5. E: There is an integer nn such that n>xn > x for every real number xx.
Show the answer and the working

The answer is B.

  1. Write the statement as: for every xx, there exists nn, with n>xn > x.
  2. Negating swaps "for every" and "there exists" and negates the inside: there exists xx, for every nn, n≤xn \le x.
  3. In words: some real number is at least as big as every integer. That is false, which is right, because the original statement is true.

Where the other options come from

  • A. Negates only the inequality and leaves both quantifiers alone.
  • C. Swaps the inner quantifier but not the outer one.
  • D. Swaps the outer quantifier but not the inner one.
  • E. Changes the order of the quantifiers instead of negating. That is a different (false) statement, not the negation.

Want more? More quantifier questions, each with a worked solution.

Not sure which topics to work on first?

The free 20-minute diagnostic asks ten questions across both papers under test conditions, then sorts your topics into gaps, right-but-slow and solid. No account needed.

Sitting the TMUA on 4 to 8 January? The January Sprint turns that result into a day-by-day plan to your test date, with full timed mocks and an estimated score after each one. It is free for the January sitting: early access, no card, nothing to pay later.

Other TMUA Paper 2 topics

Sitting the ESAT or TMUA in 2027?

Free mock papers and booking reminders by email. Nothing else.

  • New ESAT and TMUA mock papers and free practice, the day they go live.
  • A reminder before each booking deadline, so you don't miss your sitting.
  • Up to one email a week until the January tests, then at most two a month. Unsubscribe in one click.
I'm preparing for (optional)

Email me when new ESAT and TMUA practice, mock papers and the January Sprint open, and before test booking deadlines. Up to one email a week until the January 2027 tests, then at most two a month; unsubscribe with one click. We only store your email address and what you tick here. See our privacy notice.

Sources

  1. UAT-UK: Notes on Logic and Proof (June 2025, PDF)
  2. UAT-UK: TMUA content specification (PDF)
  3. UAT-UK: about the TMUA
  4. UAT-UK: TMUA preparation materials and past paper archive