TMUA: Deductions, conjectures and ordering proofs
Paper 2: deductions, conjectures and ordering a proof.
- Section 2 (Paper 2) · Prf1-Prf5 Mathematical proof · spec Prf2-Prf5
- Paper 2 only
- 17 free questions
- No calculator
What the specification covers
- Deducing what must, could or cannot be true
- Conjectures from small cases, then justification
- Putting the lines of a proof in a valid order
- Longer chains of reasoning
Key ideas
- 'Must be true' means true in every case allowed; one exception rules it out.
- Factorising often gives the structure:
, . - Parity and remainders (e.g. mod 3, mod 4, mod 8) decide many integer questions.
- To order a proof, find the statement that uses only the hypothesis, then the step that uses it, and so on.
Common mistakes
- 'Could be true' and 'must be true' are different questions.
- Negative values of variables are often allowed unless the question says otherwise.
Exam tip
List all the cases the conditions allow before judging which statements always hold.
Worked example
Worked example
The integers
I
II
III
- III only
- I, II and III
- II only
- I and III only
- II and III only
- I only
- none of them
- I and II only
Answer: H: I and II only
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 statements are true for every positive integer
I
II
III
- I and III only
- III only
- II and III only
- none of them
- I and II only
- I, II and III
- I only
- II only
Show the answer and solution
Answer: E: I and II only
I: odd + odd is even. II:
Question 2
The real numbers
I
II
III
- III only
- I and II only
- II and III only
- I only
- none of them
- II only
- I, II and III
- I and III only
Show the answer and solution
Answer: H: I and III only
Question 3
How many integers
Show the answer and solution
Answer: B:
If
Question 4
Let
Show the answer and solution
Answer: E:
Question 5
The positive integers
must equal 3 must equal 6 can take more than one value must equal 12 must equal 4
Show the answer and solution
Answer: B:
Question 6
The integers
I
II
III
- II only
- I and III only
- III only
- I only
- none of them
- I and II only
Show the answer and solution
Answer: E: none of them
Question 7
The integers
I
II
III
- I and III only
- II only
- I and II only
- none of them
- I only
- III only
Show the answer and solution
Answer: C: I and II only
Question 8
The integers
I
II
III
- II only
- none of them
- III only
- I and II only
- I and III only
- I only
Show the answer and solution
Answer: A: II only
Question 9
The integers
I
II
III
- none of them
- I and III only
- I only
- III only
- I and II only
- II only
Show the answer and solution
Answer: F: II only
Question 10
The integers
I
II
III
- III only
- I and III only
- none of them
- I only
- I and II only
- II only
Show the answer and solution
Answer: E: I and II only
Question 11
The integers
I
II
III
- I and II only
- I and III only
- I only
- II only
- III only
- none of them
Show the answer and solution
Answer: F: none of them
Question 12
The integers
I
II
III
- III only
- none of them
- I and II only
- I and III only
- I only
- II only
Show the answer and solution
Answer: B: none of them
Question 13
The integers
I
II
III
- II only
- III only
- none of them
- I and III only
- I and II only
- I, II and III
Show the answer and solution
Answer: A: II only
Work with remainders. The given conditions are
Fast method: List the parity (or remainder mod 3 / mod 4) cases the conditions allow, often only one or two, and test each statement on those cases. A single allowed pair breaks a 'must'.
Question 14
The integers
I
II
III
- I and II only
- II only
- I and III only
- I only
- none of them
- II and III only
Show the answer and solution
Answer: D: I only
Work with remainders. The given conditions are
Fast method: List the parity (or remainder mod 3 / mod 4) cases the conditions allow, often only one or two, and test each statement on those cases. A single allowed pair breaks a 'must'.
Question 15
Real numbers
I
II
III
- I, II and III
- III only
- I and II only
- II only
- I only
- II and III only
Show the answer and solution
Answer: F: II and III only
Multiplying an inequality by a negative number reverses it, squaring is only safe when both sides are non-negative, and taking reciprocals reverses an inequality between two numbers of the same sign. I (
Fast method: Pick extreme but allowed values (very large, very close to 0, negative where allowed) to hunt for a counterexample before trying to prove anything.
Question 16
Real numbers
I
II
III
- I and II only
- I and III only
- II and III only
- none of them
- I, II and III
- III only
Show the answer and solution
Answer: C: II and III only
Multiplying an inequality by a negative number reverses it, squaring is only safe when both sides are non-negative, and taking reciprocals reverses an inequality between two numbers of the same sign. I (
Fast method: Pick extreme but allowed values (very large, very close to 0, negative where allowed) to hunt for a counterexample before trying to prove anything.
28 more deductions, conjectures and ordering proofs 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: Errors in purported proofsTMUA 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.