Negation Examples: 46 Problems with Answers

Worked examples of Negation to try before you open each solution, then practice problems with answers.

Worked Examples

Example 1

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

Answer

(a)  5≤3  (False),(b)  Some cat is not black  (True)

First step

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

Full solution

  1. 2.
    (a) P: '5>3' (True). The negation reverses the inequality: ¬P: '5≤3' (False). (b) P: 'All cats are black' has form ∀x,P(x). Its negation is ∃x,¬P(x): 'There exists a cat that is not black.'
  2. 3.
    Truth values: (a) ¬P is False because 5>3 is true. (b) ¬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 (∀), the negation is an existential statement (∃). The original and its negation always have opposite truth values.

Example 2

medium
Simplify ¬(¬p∨q) using logical laws.

Example 3

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

Example 4

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

Example 5

medium
Find the negation of 'P⇔Q' (biconditional).

Example 6

hard
Write the contrapositive of 'If n2 is odd, then n is odd', then explain how it relates to the original by negation.

Example 7

hard
Show that ¬(P⇒Q)⇒P is a tautology.

Example 8

challenge
Prove by negation: show that '2 is irrational' is logically equivalent to the negation of 'there exist integers p,q with q≠0 and p/q=2 in lowest terms.'

Practice Problems

Try each one, then open the solution to compare your method.

Example 1

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

Example 2

medium
Build the truth table for ¬p and verify that p∧¬p is always false (contradiction) and p∨¬p is always true (tautology).

Example 3

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

Example 4

easy
Negate: 'It is raining.'

Example 5

easy
Simplify ¬(¬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 when P is false?

Example 9

easy
Negate the inequality x>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 P∧Q.

Example 13

medium
Use De Morgan to negate P∨Q.

Example 14

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

Example 15

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

Example 16

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

Example 17

medium
Is the negation of 'exactly one of P,Q is true' equal to 'P⇔Q'?

Example 18

medium
Negate: 'No student failed the exam.'

Example 19

medium
Negate: 'x≥3 AND x≤7', then describe the result.

Example 20

challenge
Negate fully and simplify: 'For all ε>0, there exists δ>0 such that ∣x−a∣<δ⇒∣f(x)−L∣<ε.'

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 ¬(P⇒Q) is logically equivalent to P∧¬Q using a truth table.

Example 23

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

Example 24

easy
Negate: 'The light is on.'

Example 25

easy
Negate the statement: 'y≤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: 'x is a multiple of 3 OR x is even.'

Example 29

medium
Write the negation of: 'If n is even, then n2 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 ¬(P∧Q) and verify it agrees with ¬P∨¬Q.

Example 33

hard
Negate and simplify: '∀x∈R,x2≥0.'

Example 34

hard
Negate: 'For all n∈N, there exists a prime p>n.'

Example 35

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

Example 36

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

Example 37

medium
Negate: 'Exactly one solution exists.'

Example 38

challenge
Negate and simplify: '∀ε>0,∃N∈N,∀n≥N,∣an−L∣<ε.'

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.

Ask yourself: Is this new statement true in exactly the cases where the original is false?

Concept recap

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

Negation is the other side of a bet. If you bet a die shows 6, your opponent holds every other result, 1 through 5, so exactly one of you wins. With a coin the other side is a single outcome, tails, but in general a negation covers all the remaining cases, not just one opposite case.

Read the full lesson on Negation

Negation is covered with related ideas in the guide Conditional Statements: Converse, Inverse, Contrapositive, and Biconditional.

Related concepts

Background knowledge

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

logical statement