TMUA: Quantifiers and negation
Paper 2: quantifiers and negation.
- Section 2 (Paper 2) · Arg1-Arg4 The logic of arguments · spec Arg3-Arg4
- Paper 2 only
- 15 free questions
- No calculator
What the specification covers
- for all, for some (at least one), there exists
- Negating: not (for all x, P) = there exists x with not P
- Negating and/or statements (De Morgan in words)
Key ideas
- 'For all
, P( )' is negated by 'there exists with not P( )'. - 'There exists
with P( )' is negated by 'for all , not P( )'. - 'Not (A and B)' is '(not A) or (not B)'; 'not (A or B)' is '(not A) and (not B)'. 'Or' is inclusive.
- The negation of
is .
Common mistakes
- The order of quantifiers matters: 'for every
there is a ' differs from 'there is a for every '. - Negate every part, including the inequality signs.
Exam tip
Negate from the outside in: flip each quantifier, then negate the inside.
Worked example
Worked example
Which of the following is the negation of the statement: 'For every real number
- There is a real number
and an integer with . - For every real number
, every integer satisfies . - For every real number
there is an integer with . - There is a real number
such that every integer satisfies . - There is an integer
such that every real number satisfies .
Answer: D: There is a real number
'Not (for every
Practice questions
Try each question before opening the solution. No calculator: the TMUA does not allow one. Every answer here was checked independently before it was published, and each solution ends with the fastest reliable method.
Question 1
Which of the following is the negation of the statement '
or or or or and
Show the answer and solution
Answer: D:
'Not (A and B)' is '(not A) or (not B)'. Not
Question 2
Let
I For every
II There is a
III For every
- I and III only
- III only
- I only
- I and II only
- none of them
- II only
- II and III only
- I, II and III
Show the answer and solution
Answer: D: I and II only
I: take
Question 3
Which of the following is the negation of the statement '
or and and and and
Show the answer and solution
Answer: B:
'Not (P or Q)' is '(not P) and (not Q)'. Not
Question 4
Which of the following is the negation of the statement '
or and or or or
Show the answer and solution
Answer: D:
'Not (P and Q)' is '(not P) or (not Q)'. Not
Question 5
Which of the following is the negation of the statement '
or or and or or
Show the answer and solution
Answer: A:
'Not (P and Q)' is '(not P) or (not Q)'. Not
Question 6
Which of the following is the negation of the statement '
and or or or or
Show the answer and solution
Answer: E:
'Not (P and Q)' is '(not P) or (not Q)'. Not
Question 7
Which of the following is the negation of the statement '
or or and or or
Show the answer and solution
Answer: B:
'Not (P and Q)' is '(not P) or (not Q)'. Not
Question 8
Which of the following is the negation of the statement '
or or or and or
Show the answer and solution
Answer: B:
'Not (P and Q)' is '(not P) or (not Q)'. Not
Question 9
Which of the following is the negation of the statement '
or or or or and
Show the answer and solution
Answer: A:
'Not (P and Q)' is '(not P) or (not Q)'. Not
Question 10
Which of the following is the negation of the statement '
or or and or or
Show the answer and solution
Answer: D:
'Not (P and Q)' is '(not P) or (not Q)'. Not
Question 11
Which of the following is the negation of the statement: 'For every real number
- For every real number
there is a real number such that . - For every real number
for every real number , . - There is a real number
such that there is a real number such that . - There is a real number
such that there is a real number such that . - For every real number
for every real number , .
Show the answer and solution
Answer: C: There is a real number
To negate, change every 'for every' to 'there is' and every 'there is' to 'for every', keeping the order of the variables, and negate the final condition (
Fast method: Swap each quantifier, keep the order, negate only the last condition. An option that keeps a quantifier, swaps the order of
Question 12
Which of the following is the negation of the statement: 'For every real number
- For every real number
for every real number , . - There is a real number
such that for every real number , . - There is a real number
such that there is a real number such that . - For every real number
there is a real number such that . - There is a real number
such that for every real number , .
Show the answer and solution
Answer: B: There is a real number
To negate, change every 'for every' to 'there is' and every 'there is' to 'for every', keeping the order of the variables, and negate the final condition (
Fast method: Swap each quantifier, keep the order, negate only the last condition. An option that keeps a quantifier, swaps the order of
Question 13
Let
I For every
II For every
III There is an
- I and II only
- I, II and III
- III only
- II and III only
- I only
- II only
Show the answer and solution
Answer: D: II and III only
Check each statement directly on the 5 elements of
Fast method: Read the quantifiers in order. 'For every x there is a y' lets y depend on x; 'there is an x such that for every y' does not. One failing x (or one witness) settles a statement.
Question 14
Let
I There is an
II There are
III There are
- I and III only
- none of them
- II only
- I and II only
- II and III only
- III only
Show the answer and solution
Answer: C: II only
Check each statement directly on the 4 elements of
Fast method: Read the quantifiers in order. 'For every x there is a y' lets y depend on x; 'there is an x such that for every y' does not. One failing x (or one witness) settles a statement.
28 more quantifiers and negation questions
Each with a full worked solution and a fast-method note. They also appear in topic drills, spaced review and mock papers 3 to 10.
Keep going
The next topic in the specification: notes, a worked example and free questions.
Next: Types of proof and counterexamplesTMUA is run by UAT-UK. A Level Math Revision is independent: it is not affiliated with or endorsed by UAT-UK, Pearson VUE or any university. Every question here is our own.