What you’ll work on
- Logic and proof
Start with the idea
A proof establishes a statement for every case in its stated domain. An example can support a conjecture, but a single counterexample disproves a universal claim. Distinguish an implication from its converse and distinguish necessary conditions from sufficient conditions.
Induction requires a base case and a step from an arbitrary valid integer k to k+1. State the induction hypothesis precisely and use it only for the assumed case; checking several numerical cases is not the induction step.
A worked example
Prove by induction that 1+3+...+(2 n−1)=n2 for every positive integer n.
- Base n=1 gives 1=12
- assume the sum of the first k odd numbers is k2
- adding 2 k+1 gives k2+2 k+1=(k+1)2
- induction proves the claim.
Answer: The identity holds for every integer n≥1.
Try one question
Negate: for every real x, x2>x.
Show answer and explanation
There exists a real x such that x2≤x.
Negate the universal quantifier and negate the inequality. The value x=0 is a counterexample to the original statement.
Inside the collection
| Resource | Length | Practice | Answers |
|---|---|---|---|
| Learn and practise | 4 pages | 4 questions | Included |
| Apply and extend | 4 pages | 4 questions | Included |
| Topic checkpoint | 3 pages | 4 questions | Included |
Read on a device and work in an exercise book, or print the A4 PDFs. These files are not auto-marked digital quizzes.