Topic module

Quantifiers and Negation

Interpret universal and existential claims and negate compound quantified mathematical statements precisely.

Long-form learning
Concept to Risk to Memory to Check-up

How to prepare for the current TMUA

Secure the shared mathematical specification, practise application in unfamiliar settings, then make every Paper 2 implication and proof step explicit.

Core concepts

Concept 1

Distinguish for all, for some and there exists over a stated domain.

Exam cue: State the domain before judging a quantified claim.

Concept 2

Negate universal and existential claims by changing both the quantifier and predicate.

Exam cue: Replace every with at least one not when negating.

Concept 3

Use examples and counterexamples to test quantified statements.

Exam cue: Search for one decisive counterexample to a universal statement.

Risk pitfalls and guardrails

Negating only the predicate and leaving the quantifier unchanged.

Guardrail: Do not treat examples as proof, reverse an implication, cancel a possible zero or rely on calculator-only intuition.

Treating some as exactly one rather than at least one.

Guardrail: Do not treat examples as proof, reverse an implication, cancel a possible zero or rely on calculator-only intuition.

Using a supporting example as proof of a universal claim.

Guardrail: Do not treat examples as proof, reverse an implication, cancel a possible zero or rely on calculator-only intuition.

Memory anchors

Universal

For all claims every permitted case satisfies the property.

Existential

There exists requires at least one permitted case.

Negate all

Not all are P means at least one is not P.

Negate exists

No case is P means every case is not P.

Counterexample

One valid failure disproves a universal statement.

Domain first

A quantifier has meaning only over its stated set of values.

Checkpoint rule

Do the check-up only after you can summarize each concept in one sentence and identify one dangerous pitfall from memory.

Knowledge Check (after reading)

Short check-up to confirm understanding of this module.

Check-up Questions

1-2 question checkpoint

Negate: Every integer is positive.

Negate: There exists a real x with x²=−1.

Answer all questions to submit.

Next step personalized recommendations

What is Pass Harbor?

Completely free exam prep for 247 UK exams.

  • Practice questions
  • Flashcards
  • Study guides
  • Mock exams
  • No registration
  • No paywall
  • Start instantly
No more expensive exam prep. Quality study tools should be accessible to everyone.