JC1 H3 Maths Bukit Timah | Mathematical Induction

JC1 H3 Mathematics Tutor Bukit Timah | Proof by Mathematical Induction. Did you know? Checking the first hundred examples does not prove a claim about every positive integer. Mathematical induction provides something much stronger: a reason why the first valid case leads to the next, and therefore to all later cases.

If you’re in JC1, especially while building H2 Mathematics confidence in Bukit Timah or Sixth Avenue, induction offers a useful introduction to the style of reasoning expected in H3 Mathematics. It is not about writing a formula from memory. It is about identifying exactly what the formula claims.

Quick answer: how does mathematical induction work?

Imagine a long line of numbered dominoes. A proof needs two separate guarantees: the first relevant domino falls, and whenever domino k falls, domino k+1 falls too. If both are established, the effect reaches every numbered domino in the range.

Base case: verify the statement at the starting integer, often n = 1, but sometimes n = 0 or another starting value.
Inductive hypothesis: suppose the statement is correct for a particular integer n = k.
Inductive step: use that hypothesis to demonstrate the statement for n = k+1.
Conclusion: explicitly state the valid domain: for every integer n in the claimed range.

The inductive hypothesis is a temporary assumption used to prove a conditional statement. You have not simply assumed the theorem true for all n. That distinction matters.

Worked example 1: prove the sum of the first n odd numbers

Claim: 1 + 3 + 5 + … + (2n − 1) = n² for every positive integer n.

Base: at n = 1, the left side is 1 and the right side is 1² = 1. So the first case holds.

Hypothesis: assume 1 + 3 + … + (2k − 1) = k² for an arbitrary positive integer k.

Step: the next odd number is 2(k+1) − 1 = 2k+1. Add it to the known sum. We obtain k² + (2k+1) = k²+2k+1 = (k+1)², exactly the required result for n = k+1.

Conclusion: by induction, the identity holds for every positive integer n. Did you notice how the newest term, 2k+1, is what connects the two cases? Finding that connecting term is the heart of this proof.

Worked example 2: prove a divisibility statement

Claim: 4ⁿ − 1 is divisible by 3 for every positive integer n.

Base: at n = 1, 4¹ − 1 = 3, which is divisible by 3.

Hypothesis: suppose 4ᵏ − 1 = 3m for some integer m.

Step: 4ᵏ⁺¹ − 1 = 4(4ᵏ − 1) + 3 = 4(3m) + 3 = 3(4m+1). Because 4m+1 is an integer, the expression is divisible by 3.

It is important to write the integer multiplier. Saying only that the expression “looks divisible” leaves out the mathematical reason.

Worked example 3: an inequality that grows with n

Claim: 2ⁿ ≥ n+1 for every integer n ≥ 0.

Base: at n = 0, 2⁰ = 1 and 0+1 = 1, so the claim holds.

Hypothesis: assume 2ᵏ ≥ k+1 for a certain k ≥ 0.

Step: multiplying by the positive number 2 gives 2ᵏ⁺¹ ≥ 2(k+1). Since 2(k+1) ≥ k+2 whenever k ≥ 0, we get 2ᵏ⁺¹ ≥ (k+1)+1.

Two different ideas were needed: the induction hypothesis and a new inequality valid for the allowed values of k. A tutor should ask the learner to justify both.

Why lots of examples are not a proof

Consider n² − n + 41. If you calculate several small nonnegative values of n, the expression can look prime every time. It is tempting to conjecture that it always gives a prime. But at n = 41, the value is 41² = 1681, which is composite.

Did you know? Spotting a pattern is the beginning of mathematical investigation, not the end. A counterexample disproves a universal claim; a complete induction proof requires a valid step for every relevant k.

Five mistakes students can catch before submission

Starting from n = 1 when the claim actually begins at n = 0, or failing to verify the true starting case.
Writing “assume true for all n” instead of making the specific inductive hypothesis for n = k.
Using the expression for k+1 as an unexplained fact rather than deriving it from the k case.
Failing to explain why the algebraic rearrangement gives precisely the next statement.
Forgetting that a proof with two-step dependence may require more than one starting case.

Ten-minute independent practice

Try A: show that 1 + 2 + … + n = n(n+1)/2 for n ≥ 1. The new term is k+1; add it to k(k+1)/2 and factor the result.

Try B: show that 7ⁿ − 1 is divisible by 6 for n ≥ 1. Use 7ᵏ⁺¹ − 1 = 7(7ᵏ − 1) + 6.

Check yourself: can you say why each new step depends on the hypothesis? Can you explain the allowed starting value without copying from an example?

Frequently asked questions

Is mathematical induction in the H3 Mathematics syllabus?

Yes. The 2027 Singapore–Cambridge H3 Mathematics 9820 content outline lists proof by mathematical induction among its proof and reasoning methods. Students still need the assumed H2 foundation.

Does every H3 proof need induction?

No. Proof by contradiction, construction, cases, symmetry and other methods are also relevant. Pick induction when the claim naturally progresses over integer cases.

How do I know I actually understand induction?

Try a fresh claim with no labelled steps. If you can choose the base, state the hypothesis accurately and justify the transition from k to k+1, you are making progress.

Where this fits in the official H3 Mathematics pathway

The Singapore–Cambridge H3 Mathematics 9820 syllabus for 2027 sets out mathematical statements, proof, non-routine problem solving and additional mathematical techniques. It assumes knowledge of H2 Mathematics. See the SEAB 2027 A-Level subject directory for the examination-year reference. These examples are introductory learning exercises, not reproductions of actual examination questions.

A JC1 student can use these ideas to build readiness for a potential H3 pathway, but H3 offering, selection and teaching arrangements depend on the student’s JC. Strengthen the core first with the Bukit Timah H1/H2 Mathematics guide and this H2-to-H3 readiness roadmap.

JC1 H3 Mathematics Tutor Bukit Timah | Proof by Mathematical Induction