Negation Examples in Math

Start with the recap, study the fully worked examples, then use the practice problems to check your understanding of Negation.

This page combines explanation, solved examples, and follow-up practice so you can move from recognition to confident problem-solving in Math.

Concept Recap

The negation of a statement PP, written ¬P\neg P, is the statement with the opposite truth value: true when PP is false, and false when PP is true.

Flipping true to false or false to true. 'It is NOT the case that...'

Read the full concept explanation →

How to Use These Examples

  • Read the first worked example with the solution open so the structure is clear.
  • Try the practice problems before revealing each solution.
  • Use the related concepts and background knowledge badges if you feel stuck.

What to Focus On

Core idea: The negation of P is the statement that is true exactly when P is false.

Common stuck point: The procedure for negation is the easy part; the trap is negating 'all are' as 'none are'. Asking "Is this new statement true in exactly the cases where the original is false?" first is what keeps a correct-looking calculation from being attached to the wrong concept.

Sense of Study hint: Ask: Is this new statement true in exactly the cases where the original is false?

Worked Examples

Example 1

easy
Write the negation of each statement and determine its truth value: (a) '5>35 > 3', (b) 'All cats are black.'

Answer

(a)  53  (False),(b)  Some cat is not black  (True)(a)\;5 \le 3 \;(\text{False}),\quad (b)\;\text{Some cat is not black}\;(\text{True})

First step

1
Recall that the negation ¬P\neg P of a statement PP is the statement that is true exactly when PP is false.

Full solution

  1. 2
    (a) PP: '5>35 > 3' (True). The negation reverses the inequality: ¬P\neg P: '535 \le 3' (False). (b) PP: 'All cats are black' has form x,P(x)\forall x, P(x). Its negation is x,¬P(x)\exists x, \neg P(x): 'There exists a cat that is not black.'
  2. 3
    Truth values: (a) ¬P\neg P is False because 5>35 > 3 is true. (b) ¬P\neg P is True because black cats are not the only kind — there exist non-black cats in the world.
Negation flips the truth value. For universal statements (\forall), the negation is an existential statement (\exists). The original and its negation always have opposite truth values.

Example 2

medium
Simplify ¬(¬pq)\neg(\neg p \lor q) using logical laws.

Example 3

medium
Use De Morgan's law to negate: 'x>2x>2 AND x<10x<10'.

Example 4

medium
Show that ¬(¬(¬P))\neg(\neg(\neg P)) simplifies to ¬P\neg P.

Example 5

medium
Find the negation of 'PQP \Leftrightarrow Q' (biconditional).

Example 6

hard
Write the contrapositive of 'If n2n^2 is odd, then nn is odd', then explain how it relates to the original by negation.

Example 7

hard
Show that ¬(PQ)P\neg(P \Rightarrow Q) \Rightarrow P is a tautology.

Example 8

challenge
Prove by negation: show that '2\sqrt{2} is irrational' is logically equivalent to the negation of 'there exist integers p,qp, q with q0q \neq 0 and p/q=2p/q = \sqrt{2} in lowest terms.'

Practice Problems

Try these problems on your own first, then open the solution to compare your method.

Example 1

easy
Write the negation of: (a) 'It is raining', (b) 'x5x \ge 5', (c) 'Every student passed.'

Example 2

medium
Build the truth table for ¬p\neg p and verify that p¬pp \land \neg p is always false (contradiction) and p¬pp \lor \neg p is always true (tautology).

Example 3

easy
If PP is true, what is the truth value of ¬P\neg P?

Example 4

easy
Negate: 'It is raining.'

Example 5

easy
Simplify ¬(¬P)\neg(\neg P).

Example 6

easy
Negate: 'All cats are black.'

Example 7

easy
Negate: 'Some students passed.'

Example 8

easy
What is the truth value of ¬P\neg P when PP is false?

Example 9

easy
Negate the inequality x>5x > 5.

Example 10

easy
Negate: 'The number is even.'

Example 11

medium
Negate: 'All primes are odd.' Is the negation true?

Example 12

medium
Use De Morgan to negate PQP \wedge Q.

Example 13

medium
Use De Morgan to negate PQP \vee Q.

Example 14

medium
Negate: 'If it rains, then the game is cancelled.'

Example 15

medium
Negate: 'For every xx, there exists yy such that y>xy > x.'

Example 16

medium
Negate: 'The function is continuous AND differentiable.'

Example 17

medium
Is the negation of 'exactly one of P,QP,Q is true' equal to 'PQP\Leftrightarrow Q'?

Example 18

medium
Negate: 'No student failed the exam.'

Example 19

medium
Negate: 'x3x \ge 3 AND x7x \le 7', then describe the result.

Example 20

challenge
Negate fully and simplify: 'For all ε>0\varepsilon>0, there exists δ>0\delta>0 such that xa<δf(x)L<ε|x-a|<\delta \Rightarrow |f(x)-L|<\varepsilon.'

Example 21

challenge
Negate: 'Every even integer greater than 2 is the sum of two primes' (Goldbach). State what a disproof would require.

Example 22

challenge
Show ¬(PQ)\neg(P \Rightarrow Q) is logically equivalent to P¬QP \wedge \neg Q using a truth table.

Example 23

easy
Write the negation of the statement: 'x=4x = 4'.

Example 24

easy
Negate: 'The light is on.'

Example 25

easy
Negate the statement: 'y0y \leq 0'.

Example 26

medium
Negate: 'There is at least one black swan.'

Example 27

medium
Negate: 'Every triangle has three sides.'

Example 28

medium
Negate: 'xx is a multiple of 3 OR xx is even.'

Example 29

medium
Write the negation of: 'If nn is even, then n2n^2 is even.'

Example 30

medium
Negate: 'At most 5 students passed.'

Example 31

medium
Negate: 'At least 3 cards are red.'

Example 32

medium
Build a truth table for ¬(PQ)\neg(P \land Q) and verify it agrees with ¬P¬Q\neg P \lor \neg Q.

Example 33

hard
Negate and simplify: 'xR,x20\forall x \in \mathbb{R}, x^2 \geq 0.'

Example 34

hard
Negate: 'For all nNn \in \mathbb{N}, there exists a prime p>np > n.'

Example 35

hard
Negate: 'x>0x>0 AND (y<0y<0 OR z=5z=5).'

Example 36

hard
Negate: 'Every continuous function on [0,1][0,1] attains its maximum.'

Example 37

medium
Negate: 'Exactly one solution exists.'

Example 38

challenge
Negate and simplify: 'ε>0,NN,nN,anL<ε\forall \varepsilon > 0, \exists N \in \mathbb{N}, \forall n \geq N, |a_n - L| < \varepsilon.'

Related Concepts

Background Knowledge

These ideas may be useful before you work through the harder examples.

logical statement