JC2 H3 Mathematics Tutor Bukit Timah

Did you know? You can determine the last digit of 7 raised to the power 2026 without calculating the enormous number. The reason is that powers repeat their remainders in a small cycle. When mathematics shifts attention from the size of a number to its remainder, difficult-looking arithmetic becomes surprisingly manageable.

That is the idea behind modular arithmetic, a named content area in Singapore–Cambridge H3 Mathematics (9820). If you are a JC2 student seeking a Mathematics tutor in Bukit Timah, I would first ask whether you can explain what a congruence means in plain English. That definition is the foundation for every clever remainder proof that follows.

Quick answer: The statement a≡b (mod m) means m divides a−b, where m is a positive integer. You can add and multiply congruences with the same modulus. You cannot always divide both sides by the same integer. Learn the definition, identify a short cycle, and prove why the chosen modulus actually settles the claim.

What does a≡b (mod m) really say?

Let m be a positive integer. The notation a≡b (mod m) means that the difference a−b is a multiple of m. For example, 17≡2 (mod 5) because 17−2=15, which is divisible by five.

The statement is about integer congruence, not ordinary equality. Seventeen and two are not the same integer, but they occupy the same remainder class when divided by five. You can also say that they have the same remainder modulo five.

Negative integers still work. For example, −7≡3 (mod 5) because −7−3=−10. The remainder-class notation does not depend on numbers being positive.

Congruence is reflexive (a≡a), symmetric (a≡b implies b≡a), and transitive (if a≡b and b≡c, then a≡c). These properties follow from divisibility and let us reason with whole collections of numbers that share a remainder.

If a statement feels abstract, test it with the definition: subtract the two integers and ask if the modulus divides the difference. This is often more reliable than trying to recall an isolated trick.

Addition and multiplication work; cancellation needs care

If a≡b (mod m) and c≡d (mod m), then a+c≡b+d (mod m) and ac≡bd (mod m). Why? Write a−b=mr and c−d=ms for integers r,s. The sum difference is m(r+s); the product difference ac−bd=(a−b)c+b(c−d), also a multiple of m.

Raising two congruent integers to the same nonnegative integer power preserves congruence. For example, 7≡2 (mod 5) implies 7³≡2³ (mod 5), and both give remainder three. Powers become much easier once the base is replaced by a small equivalent representative.

But division is dangerous. Consider 2x≡2 (mod 6). It says six divides 2(x−1), equivalent to three dividing x−1. So x≡1 (mod 3), with x≡1 or 4 (mod 6).

If we cancelled the 2 and incorrectly wrote x≡1 (mod 6), we would lose x≡4 (mod 6), which is a genuine solution. Cancellation modulo m is safe when the cancelled factor is coprime to m. Otherwise the modulus usually changes or several classes remain.

In advanced work, writing the divisibility statement beneath the congruence gives a useful self-check before any cancellation or reduction of a modulus.

A fast last-digit method and a useful digit-sum proof

The final decimal digit of any integer is its remainder modulo ten. Start with 7: the powers end in 7, 9, 3, 1, then 7 again. Their remainders form a cycle of length four.

Since 2026=4×506+2, the exponent leaves remainder two on division by four. Therefore 7²⁰²⁶ has the same last digit as 7², which is 9. The answer does not require a calculator displaying the huge power.

How can we prove a divisibility rule for nine? Every power 10ᵏ is congruent to 1 modulo nine because 10≡1 (mod 9). Write a nonnegative integer in decimal as N=d₀+10d₁+10²d₂+⋯. Modulo nine, N≡d₀+d₁+d₂+⋯.

Therefore N is divisible by nine if and only if the sum of its digits is divisible by nine. It is an everyday arithmetic shortcut resting on a clear proof. The same reasoning modulo three explains the divisibility-by-three digit-sum rule.

The lesson is not ‘remember which numbers divide by digit sums’. It is to identify a base whose powers become simple modulo a selected divisor, then translate that structure into a useful result.

Full proof: n⁵−n is divisible by 30 for every integer n

Target: Show that 30 divides n⁵−n. Since 30=2×3×5 and 2,3,5 are pairwise coprime, it is enough to show that each of those three factors divides the expression.

Modulo 2: Every integer n is congruent to 0 or 1 (mod 2). For either remainder, n⁵≡n (mod 2). Therefore n⁵−n≡0 (mod 2).

Modulo 3: Every integer n is congruent to 0,1 or −1 (mod 3). Fifth powers preserve each of these residues: 0⁵=0, 1⁵=1 and (−1)⁵=−1. Thus n⁵−n≡0 (mod 3).

Modulo 5: Every integer is congruent to 0, ±1 or ±2 (mod 5). The fifth powers give 0, ±1 and ±32 respectively, with ±32≡±2 (mod 5). Hence n⁵≡n (mod 5), so n⁵−n is divisible by five.

Conclusion: The integer n⁵−n is divisible by each of the pairwise coprime numbers 2, 3 and 5. Consequently it is divisible by their product, 30. The proof covers every integer, including zero and negative values.

Observe the architecture: split a compound divisibility target into a small number of residue problems, solve each exhaustively, and combine the results. Saying ‘clearly divisible by thirty’ without showing the component claims would hide the reasoning that earns trust.

Squares: sometimes a residue makes a problem impossible

Perfect squares have restricted remainders. For any integer n, the remainder modulo four is 0,1,2 or 3. Squaring these possibilities gives 0,1,0 or 1 (mod 4). So an integer square is never congruent to two modulo four.

This immediately proves that the equation n²=4k+2 has no integer solution, for any integer k. Instead of guessing values, you reject the entire possibility using a complete residue table.

An even stronger result is that an odd square is congruent to one modulo eight. Let n=2k+1. Then n²=4k(k+1)+1. Because one of k and k+1 is even, 4k(k+1) is divisible by eight. Therefore n²≡1 (mod 8).

The right modulus is not always the biggest one. Small moduli such as 2,3,4,5 or 8 can expose impossibilities quickly. A good proof states why the selected residues exhaust every permitted integer.

This idea connects naturally to proof by contradiction: if a hypothetical solution would force a square to have an impossible residue, then no such integer solution exists.

Twelve original modular arithmetic clinics

1. Negative representative

−7≡3 (mod 5) because −7−3=−10 is divisible by five.

2. Same remainder

24≡4 (mod 10). Both numbers have final digit four; their difference is twenty.

3. Squares modulo four

An integer square is 0 or 1 (mod 4). Check the four residue classes 0,1,2,3.

4. Odd squares modulo eight

If n=2k+1, n²=4k(k+1)+1≡1 (mod 8). The parity of k(k+1) is essential.

5. Consecutive numbers

n(n+1) is even for every integer n because one of two consecutive integers is divisible by two.

6. Three consecutive integers

n(n−1)(n+1) is divisible by three since one of three consecutive integers is a multiple of three.

7. Cancelling incorrectly

2x≡4 (mod 6) is equivalent to x≡2 (mod 3), not only x≡2 (mod 6). Modulo six, both x≡2 and x≡5 work.

8. Safe cancellation

If 5x≡5y (mod 6), then x≡y (mod 6) because gcd(5,6)=1.

9. Last digit of a power

7²⁰²⁶ has last digit nine because the powers of seven repeat 7,9,3,1 modulo ten and 2026≡2 (mod 4).

10. Digit-sum rule

The number 12,345 has digit sum fifteen and is not divisible by nine. Its remainder modulo nine equals fifteen modulo nine, which is six.

11. Two remainder conditions

Solve x≡1 (mod 3) and x≡2 (mod 5). One solution is x=7; all integer solutions are x≡7 (mod 15).

12. Spot a contradiction

An integer cannot satisfy x²≡2 (mod 4). Proving every square has residue zero or one rules out the claim.

Three mistakes that appear even in strong scripts

First, treating congruence as ordinary equality and dividing by a factor without checking whether it is coprime to the modulus. Second, examining a few residues without showing that the cases cover all integers. Third, claiming divisibility by a product just because the expression is divisible by each factor, while overlooking the need to account for shared prime factors.

For example, a number divisible by four and by six need not be divisible by twenty-four: twelve is divisible by both, but not by twenty-four. With pairwise coprime factors such as 2,3,5, divisibility by all three does imply divisibility by their product.

To audit a proof, underline the modulus each time it appears. If the modulus changes, explain why. If you use an inverse or cancellation, check the greatest common divisor. If your proof uses residue cases, list them clearly.

Modular arithmetic is a way of preserving structure, not a licence to discard information without justification. The best short solutions are concise because the missing cases have genuinely been handled.

A JC2 H3 study and tutor checklist

Begin by translating twenty congruence statements into divisibility claims and back again. Then practise powers modulo five, seven and ten, and compare cycles. For each proof, write a short reason that the chosen period repeats.

Move on to square residues modulo four and eight, then use them to reject impossible integer equations. Only after that attempt multi-modulus divisibility arguments such as the n⁵−n example.

A useful tutor should ask: ‘Can you justify cancelling that factor?’ and ‘Have you covered every possible residue?’ This diagnoses reasoning more precisely than grading only the last digit or numerical answer.

The eduKateSG original small-group reference near Sixth Avenue MRT describes a three-learner Secondary 1 programme. It is not verification of a current JC2 H3 class; families should enquire about H3 tutoring scope and availability directly.

Frequently asked questions

Is modular arithmetic included in H3 Mathematics 9820?

Yes. The 2026 and 2027 Singapore–Cambridge H3 Mathematics content outlines include concepts of congruence and modular arithmetic.

What does a≡b (mod m) mean?

It means a and b are integers whose difference is divisible by the positive modulus m. They have the same remainder class modulo m.

Why can I multiply congruences but not always divide them?

Multiplication preserves divisibility of differences. Cancellation may discard solutions unless the factor being cancelled is coprime to the modulus.

What modulus is best for a proof?

Choose a modulus that exposes a structural restriction: small remainders, an impossible square class, a repeated power cycle or a factor of the desired divisor.

Is testing ten cases sufficient to prove an integer theorem?

Only if those cases exhaust the relevant residue classes, with their completeness explained. Randomly testing ten integers cannot prove a statement about all integers.

Official reference and more reasoning practice

The 2027 H3 Mathematics 9820 syllabus explicitly lists congruence and modular arithmetic. Current JC2 candidates can also consult the 2026 official syllabus for their examination year.

If a residue argument leads to a contradiction, see the guide to counterexamples and contradiction. If you want a broader counting viewpoint, read induction and the pigeonhole principle. These ideas connect because all three rely on clearly stated cases and valid general arguments.

JC2 H3 Mathematics Tutor Bukit Timah | Modular Arithmetic, Congruence and Divisibility