Lesson 2: Statements, negation and quantifiers

Negating quantified statements

SkillNegation and quantifiers

Worked example

  • Simple familiar
  • Technology free

Write the negation of each statement, in words or symbols. For (b) and (c), state which is true: the statement or its negation.

(a) Every student in the class owns a phone.

(b) ∃n∈Z, n2=50\exists n \in \mathbb{Z},\ n^2 = 50

(c) For all n∈Z+n \in \mathbb{Z}^+, if nn is prime then nn is odd.

1 of 4 steps
  1. Step 1: Negate (a)

    "Every student owns a phone" is false as soon as one student does not. Negation: "There is a student in the class who does not own a phone."

Try a similar one

A fresh question of the same kind, checked as you answer, with hints and a full solution.

Method

  1. Swap ∀↔∃\forall \leftrightarrow \exists.

  2. Negate the property: == becomes ≠\ne, >> becomes ≤\le, "P⇒QP \Rightarrow Q" becomes "PP and not QQ".

  3. Keep the set the variable comes from.

Watch out for

  • Negating "if nn is prime then nn is odd" as "if nn is prime then nn is even". The negation of an implication is not an implication.

Save your progress with a free account