Check the starting point
- Negate quantified statements correctly.
- Factor algebraic expressions with integer parameters.
Show the idea
Induction separates assumption from conclusion
| Stage | Claim for sum 1+2+...+n |
|---|---|
| Base n=1 | 1= |
| Hypothesis | Assume |
| New term | |
| Substitute and factor |
The induction step treats an arbitrary positive integer k. Checking a few numerical cases does not replace the argument.
Work through an example
Prove by induction that 1+3+...+(2 n −1)= for every positive integer n.
- Base case: at n=1, the left side is 1 and the right side is
=1, so the statement is true.
- Induction hypothesis: assume 1+3+...+(2k-1)=
for an arbitrary positive integer k.
- The next odd number is 2(k+1)-1=2k+1. Add it to both sides of the assumed identity.
- The first k+1 odd numbers sum to
+2k+1=
. This proves the implication from k to k+1.
- By mathematical induction, the identity holds for every positive integer n.
Answer: The identity holds for every integer n≥1.
Teach in small steps
- Read the visual model together: The induction step treats an arbitrary positive integer k. Checking a few numerical cases does not replace the argument.
- Model this example aloud: Negate: for every integer n,
+n is divisible by 4. Guide: Negate the quantifier and the predicate. For example n=1 gives 2, a witness to the negation. Result: There exists an integer n for which
+n is not divisible by 4.
- Let your learner choose the steps for a new situation: Prove by induction that 1+2+...+n=
for positive integers n. Ask which part of the model or rule carries over before checking the worked solution.
- After a short break, ask for an independent response: Is divisibility by 3 necessary, sufficient, or both for divisibility by 12? Compare both the method and conclusion with the checkpoint answers, then revisit any misconception.
Ask and listen
- Prove that the sum of three consecutive integers is divisible by 3.
- Prove that if an integer is odd, its square is congruent to 1 modulo 8.
Adapt the practice
More support
Start with this prerequisite: Negate quantified statements correctly. Keep the visual visible. For the first guided problem, focus on this step: Negate the quantifier and the predicate. For example n=1 gives 2, a witness to the negation.
More challenge
Try this application without looking at its answer: Prove by induction that 5 divides −1 for every n≥1. Then explain why the answer fits the stated domain or context.
Look for understanding
- Your learner can complete this checkpoint and explain the method: Is divisibility by 3 necessary, sufficient, or both for divisibility by 12?
- Your learner can justify or challenge this statement/question using the mathematical definitions: Prove that if an integer is odd, its square is congruent to 1 modulo 8.
Choose the next step
If either checkpoint needs prompting, repeat the worked model with changed values and revisit this caution: An implication and its converse are different statements. When both are secure, use the linked Apply and extend resource and relevant VCE Key Knowledge/Key Skills activity.
Put the idea into practice
The matching topic collection includes learn-and-practise, application and checkpoint PDFs with worked answers. Download the free preview to see representative pages.
Explore this topic’s worksheets