JC2 H3 Mathematics Tutor Bukit Timah | Induction & Pigeonhole

Did you know? A room with thirteen people guarantees that two share a birth month, even before you know anyone’s birthday. There are only twelve month categories. This beautifully simple idea—the pigeonhole principle—belongs in the world of H3 Mathematics, where a short observation can become a powerful proof.

For anyone looking for a JC2 H3 Mathematics tutor in Bukit Timah, two reasoning habits deserve early attention: proving a pattern for infinitely many whole-number cases using mathematical induction, and forcing a conclusion from the number of objects and available categories using the pigeonhole principle.

Quick answer: Mathematical induction has a base case and a valid step from the case n=k to n=k+1. The pigeonhole principle says that placing more objects than boxes forces at least one box to contain more than one object. Both appear in the Singapore–Cambridge H3 Mathematics (9820) content outline, and both require the student to explain why the mechanism fits the question.

Two 30-second checks that reveal the reasoning gap

Check one: a pupil computes 1+2+3+4=10, 1+2+3+4+5=15 and decides the general sum is n(n+1)/2. That is an excellent conjecture, but does it prove the formula for every positive integer n? No. The student must supply a universal argument, such as induction.

Check two: ask whether six distinct integers chosen from 1 to 10 must include consecutive numbers. Yes. Pair the numbers into five boxes: {1,2}, {3,4}, {5,6}, {7,8}, {9,10}. Six chosen numbers force two into one pair, and those two are consecutive.

A student might answer both questions correctly through instinct. Advanced mathematical writing asks them to make the reason explicit, showing why the conclusion is unavoidable rather than merely plausible.

Induction: how one step covers infinitely many cases

Think of an infinite row of dominoes. The first domino falls, and whenever any domino falls, the next domino also falls. You do not need to push them all individually. Mathematical induction formalises that pattern for statements indexed by integers.

Base case: Prove that the statement P(1) holds, or whatever first integer the problem specifies. Inductive hypothesis: Assume P(k) holds for an arbitrary permitted integer k. Inductive step: Use that assumption to prove P(k+1). Conclusion: State that the property holds for every integer in the specified range.

The word arbitrary is critical. A step verified only for k=2 or k=3 is not the general link in the chain. Nor may the student quietly assume P(k+1) while claiming to derive it.

In an H3 proof, a good inductive hypothesis includes the entire claim and any hypotheses attached to the integer. If a formula has a domain restriction, carry that restriction into the inductive step.

Induction is not the same as noticing a pattern from a table. Pattern-finding suggests what P(n) might be; induction justifies why P(n) continues indefinitely. Both skills are useful, but they play different roles.

Full worked example: the sum of the first n positive integers

Claim: For every positive integer n, 1+2+⋯+n=n(n+1)/2.

Base case n=1: The left side is 1. The right side is 1(2)/2=1. Therefore P(1) holds.

Inductive hypothesis: For an arbitrary positive integer k, suppose 1+2+⋯+k=k(k+1)/2.

Step: The sum to k+1 is (1+2+⋯+k)+(k+1). Substitute the hypothesis: k(k+1)/2+(k+1)=(k+1)(k+2)/2. This is the required formula when n=k+1.

Conclusion: Because the base case holds and P(k) implies P(k+1), the identity holds for every positive integer n by mathematical induction.

The decisive step is not writing the formula twice. It is using the claim at k to derive the claim at k+1, with the extra term accounted for. That is where many otherwise tidy solutions quietly fail.

Pigeonhole principle: choose the boxes carefully

At its simplest, n+1 objects placed into n categories must put at least two into a common category. The categories do not need to be literal containers. They may be remainders, birthdays, intervals, colours or pairs of integers.

Birth months: Thirteen people and twelve possible birth months guarantee two people share a birth month. Nothing about the distribution of actual birthdays is required.

Remainders: Eight integers divided by seven can have remainders only 0,1,2,3,4,5,6. Thus two of the eight have the same remainder. Their difference is divisible by seven. This is an unusually powerful jump from a counting statement to a divisibility result.

Consecutive integers: Six selected numbers from 1 to 10 guarantee consecutive numbers by the five-pair construction. A proof should identify the boxes in which a collision forces exactly the desired relationship.

Generalised principle: If N objects are distributed among k nonempty categories, some category contains at least ⌈N/k⌉ objects. Thus among eleven integers there must be three with the same remainder modulo five, because ⌈11/5⌉=3.

Avoid an appealing but incorrect shortcut: saying ‘the categories overlap so a collision must happen’. Define the categories so that each object has one assigned box, or explain the counting carefully. In a geometric partition, boundary points may need an explicit convention.

Counting twice and using symmetry

Combinatorial proof often succeeds when you count the same collection in two ways. Suppose a group of people shake hands in pairs, and dᵢ counts the number of handshakes made by person i. Summing every dᵢ counts every handshake twice, once at each endpoint.

Therefore the sum of all the degrees is even. In graph-theory language, the number of vertices of odd degree is even. To see why, note that the number of odd addends in an even total must itself be even.

This is not merely a trick about social situations. The method is double counting: define a collection of objects and two valid ways to enumerate it. When the two expressions count the same collection, equate them.

Symmetry can also remove repeated work. If a problem treats objects identically under swapping their labels, ask whether two cases are actually equivalent. But justify the claimed symmetry; two configurations may look similar without having the same constraints.

The H3 content outline includes symmetry principles and combinatorial arguments. They are most useful when a direct brute-force calculation hides an invariant, a fixed total or a structural pairing.

Twelve original H3-style learning clinics

1. Thirteen months?

Thirteen people, twelve birth months: two must share a month. The chosen categories are the twelve calendar months, not individual dates.

2. Eight integers, seven remainders

Every integer has one remainder modulo 7. Two of eight share a remainder, so their difference is a multiple of 7.

3. Six numbers from 1 to 10

Group the numbers as {1,2}, {3,4}, {5,6}, {7,8}, {9,10}. Six picks force one full pair, hence two consecutive values.

4. Eleven numbers from 1 to 20

Use ten adjacent pairs {1,2} through {19,20}. Eleven distinct picks force a consecutive pair.

5. Eleven integers modulo five

There are five possible remainders. Since 11>2×5, some remainder appears at least three times.

6. Base case changes with the domain

For a claim on integers n≥3, induction starts at n=3, not n=1. Always match the base case to the statement’s domain.

7. A sum of odd numbers

The first n positive odd numbers total n². Base n=1 is true; adding the next odd number 2n+1 to n² gives (n+1)².

8. Divisibility of 3ⁿ−1 by two

For n=1, 3−1=2. If 3ᵏ−1 is even, then 3ᵏ⁺¹−1=3(3ᵏ−1)+2 is even. This proves all positive integer n.

9. Three consecutive integers

Among n−1,n,n+1, one is divisible by 3 and at least one is even. Thus n³−n=(n−1)n(n+1) is divisible by six for every integer n.

10. Five points in a square

Place five points in a unit square partitioned into four 1/2-by-1/2 subsquares. Two lie in one subsquare; their distance is at most √2/2. Assign shared boundaries consistently.

11. A handshake count

Three people record degrees 1,1,2 after two handshakes. The total 4 equals twice the number of handshakes. This illustrates the double-counting identity.

12. The missing inductive step

Verifying P(1), P(2) and P(3) is not induction. One must show P(k) ⇒ P(k+1) for arbitrary k in the permitted range.

Five mistakes worth catching before examination week

Mistake one: A proof asserts that the base case is obvious without checking the exact first term. Mistake two: The inductive step proves an unrelated but nearby formula. Mistake three: The inductive hypothesis is used before it is clearly stated.

Mistake four: The pigeonhole boxes are selected so that a collision does not actually guarantee the desired conclusion. Mistake five: The proof demonstrates that a configuration is possible, when the problem asks whether it is necessary.

To self-check induction, circle the part of the calculation where P(k) is used. To self-check pigeonhole arguments, underline the objects, boxes and exact conclusion forced by sharing a box. These simple edits make advanced logic more visible.

Proof-writing benefits from carefully chosen difficult questions, but repetition without feedback can preserve a mistaken method. Ask for correction at the precise first invalid line.

A practical revision and tutorial route

Practice 1: Write two induction proofs with explicit base, hypothesis, step and conclusion. Practice 2: Compare a valid induction proof with one containing a circular step. Practice 3: Solve remainder and consecutive-number pigeonhole questions by drawing the box categories.

Practice 4: Explain a counting argument without symbols first, then formalise it. Practice 5: Solve a mixed non-routine question and list the possible starting strategies—induction, cases, working backwards or pigeonhole.

For a JC2 student in Bukit Timah, a productive tutoring conversation should distinguish concept selection from arithmetic fluency. A student can know the induction formula but not know when induction is appropriate; the next exercise should target method choice.

The eduKateSG small-group reference near Sixth Avenue MRT documents a three-student approach for Secondary 1 Mathematics. Its format is an example of close feedback, not confirmation of a JC2 H3 class. Ask eduKateSG directly about current H3 subject coverage, timetable and availability.

Frequently asked questions

Is induction tested in H3 Mathematics?

Mathematical induction is listed as a proof method in the H3 Mathematics 9820 syllabus. It is also useful in problems that connect sequences, sums and divisibility.

Is the pigeonhole principle only a birthday trick?

No. It applies whenever more objects than categories force a shared category. Residues, pairs, intervals and geometric partitions are common mathematical interpretations.

How many cases must an induction proof check?

A valid induction proof establishes an appropriate base case and a general inductive step; it does not need to inspect every integer separately.

Does H3 expect students to write complete explanations?

Yes. The syllabus emphasises constructing mathematical arguments, making deductions and communicating mathematical reasoning.

What if the student knows the solution but cannot choose a method?

Try classifying the problem’s features before calculating: repeated integer stages suggest induction; too many objects for few categories suggests pigeonhole; conserved totals suggest counting or invariants.

Official source and companion reading

The 2026 H3 Mathematics 9820 syllabus confirms induction, the pigeonhole principle, symmetry and combinatorial proof within its reasoning content. Students preparing for a different exam year should check the SEAB 2027 subject index and their school’s current advice.

For connected proof skills, read counterexamples and proof by contradiction and quantifiers and precise statements. The goal is not to memorise isolated tricks but to know when each proof architecture fits.

JC2 H3 Mathematics Tutor Bukit Timah | Induction and the Pigeonhole Principle