Did you know? The remainder of 2¹⁰⁰ when divided by seven is just two. You do not need to expand the 31-digit number. Since 2³=8≡1 (mod 7) and 100=3×33+1, we have 2¹⁰⁰≡(2³)³³×2≡2 (mod 7).
For a JC2 H3 Mathematics student in Bukit Timah, this small calculation introduces a deeper theorem about prime numbers, modular powers and rigorous proof. Singapore–Cambridge H3 Mathematics (9820) officially includes congruence, modular arithmetic, bijections and proof, while Fermat’s Little Theorem is a useful enrichment application rather than a separately named additional syllabus topic.
Quick answer: If p is prime and p does not divide integer a, then a^(p−1)≡1 (mod p). For every integer a, including multiples of p, a^p≡a (mod p). When reducing an exponent, state why the theorem applies and remember that p−1 may not be the shortest repeating period.
What the theorem says and does not say
Modular congruence a≡b (mod m) means that the positive integer m divides a−b. Congruent numbers share the same remainder under division by m. Addition, subtraction and multiplication preserve congruence, as does raising congruent integers to the same nonnegative integer power.
The prime condition is critical. Arithmetic modulo a prime has a special property: every nonzero residue is invertible. Composite moduli may contain nonzero elements without inverses; the simple prime-exponent statement cannot be used indiscriminately.
The nonzero-base condition is also important. When a is a multiple of p, a^(p−1) is congruent to zero, not one. However a^p≡a still holds: both sides reduce to zero. These are two related but different theorem statements.
An exponent period is not necessarily the minimal cycle. Fermat guarantees that p−1 gives a return to residue one for an invertible base, but sometimes a smaller exponent already works. For example, two modulo seven returns to one after three steps, even though p−1 is six.
The theorem is a one-way claim. A composite number can satisfy an apparent Fermat congruence for selected bases; observing one successful test does not prove the modulus prime. Strong H3 reasoning carefully distinguishes a statement from its converse.
A constructive proof using a residue permutation
Let p be prime, let a be an integer not divisible by p, and consider the nonzero residues 1,2,…,p−1. Multiply each by a and reduce modulo p. None of these products is congruent to zero, because a product divisible by prime p would force p to divide one factor.
The resulting residues are distinct. If ar≡as (mod p), then p divides a(r−s). Since p does not divide a, it divides r−s. With r and s in {1,…,p−1}, their difference has absolute value below p, so r=s.
Multiplying by a therefore permutes the p−1 nonzero residue classes. The product of the permuted list must be congruent to the product of the original list, yielding a^(p−1)(p−1)!≡(p−1)! (mod p).
No number from one to p−1 is divisible by p, so (p−1)! is invertible modulo p. Cancelling it gives a^(p−1)≡1 (mod p). The proof is complete, and each step explains the role of primality.
This is an example of H3 mathematical reasoning through a bijection. A finite collection is rearranged without losing or repeating an element, and comparing two ways to describe the rearrangement produces an algebraic theorem.
A different proof via the binomial theorem
For prime p, the binomial coefficient C(p,k) is divisible by p whenever 1≤k≤p−1. In p! the prime factor p appears, while neither k! nor (p−k)! contains p. This is why the intermediate binomial terms vanish modulo p.
Expand (a+1)^p. Modulo p, only the two end terms remain, so (a+1)^p≡a^p+1 (mod p). Starting at a=0 and using induction, we obtain a^p≡a for every nonnegative integer a.
Every negative integer is congruent modulo p to a nonnegative representative. Since powers preserve congruence, a^p≡a extends to every integer a. When p does not divide a, invertibility permits cancellation of a to obtain a^(p−1)≡1.
The binomial proof and permutation proof reach the same result using different mathematical structures. One emphasises combinatorial coefficients and induction; the other uses a finite bijection. Comparing them is useful H3 proof practice.
Do not omit the primality premise. For p=4, C(4,2)=6 is not divisible by four; the binomial argument would fail at the middle terms.
Worked example: huge powers, short calculations
To calculate 2¹⁰⁰ modulo seven, Fermat gives 2⁶≡1. We can write 100=6×16+4, leaving 2⁴=16≡2 (mod 7). A shorter direct observation 2³≡1 gives the same remainder because 100=3×33+1.
Now calculate 5¹⁰¹ modulo thirteen. Here 5²=25≡−1 (mod 13), so 5⁴≡1. Since 101=4×25+1, 5¹⁰¹≡5. Thus thirteen divides 5¹⁰¹−5.
Calculating the whole power would obscure the real structure. The useful proof identifies a valid repeated factor, decomposes the exponent into a multiple of its period plus a remainder, and checks the small remaining power.
An exact order requires more work. For two modulo seven, the powers 2,4,1 establish order three: no smaller positive exponent yields one. For three modulo seven, the sequence 3,2,6,4,5,1 establishes order six.
Fermat says both bases return to one after six powers, but it does not claim that six is minimal for both. A reader should distinguish a guaranteed period from the smallest period of a particular base.
Modular inverses and linear congruences
Suppose 3x≡4 (mod 7). To isolate x, find an integer that multiplies by three to give remainder one modulo seven. Since 3×5=15≡1, five is the inverse of three modulo seven.
Multiplying the congruence by five gives x≡20≡6 (mod 7). Check: 3×6=18≡4. The result is a residue class, not only one ordinary integer.
Fermat provides a general inverse construction. If p is prime and a is nonzero modulo p, then a^(p−1)≡1. So a^(p−2) is an inverse of a. For small numbers, direct inspection may be quicker, but the theorem explains why an inverse exists.
Do not use the inverse formula when the base is divisible by p. Nor can a nonzero residue necessarily be inverted modulo a composite number. Two has no inverse modulo six because an even product cannot be congruent to one modulo six.
The correct criterion for an inverse modulo a positive integer m is gcd(a,m)=1. This is the bridge from Fermat’s prime setting to broader linear congruences and the Euclidean algorithm.
Composite moduli, false converses and stronger extensions
With modulus nine and base two, a careless prime-style rule would predict 2⁸≡1. Yet 2⁸=256≡4 (mod 9). This counterexample shows why primality cannot simply be dropped.
Some composite moduli nevertheless pass a Fermat-style test for particular bases. For instance 341=11×31 is composite but satisfies 2³⁴⁰≡1 (mod 341). Thus a successful test is not a proof of primality.
Euler’s theorem gives a broader statement: when gcd(a,m)=1, a^φ(m)≡1 (mod m), where φ(m) counts residues in {1,…,m} coprime to m. It is a connected advanced extension, not a separate guaranteed H3 topic.
For m=9, φ(9)=6, and 2⁶=64≡1 (mod 9). This correct exponent is different from eight, illustrating why the prime formula cannot be transferred without adjustment.
Even Euler’s φ(m) may be larger than the exact multiplicative order of a particular base. The most efficient exponent calculation can use a shorter verified cycle, but any reduction must be justified by a congruence returning to one.
A good student should be able to distinguish the theorem itself, its converse, an appropriate extension, and a special-case arithmetic shortcut. Those distinctions are more important than memorising a list of large numbers.
56 original modular-power learning clinics
1. 2¹⁰⁰ modulo seven
Worked answer: 2³≡1 and 100=3×33+1, so 2¹⁰⁰≡2.
Why it matters: Find a short verified period before reducing a large exponent. A clear JC2 response gives the modulus, the applicable theorem and the congruence that makes the reduction valid.
2. 2¹⁰¹ modulo seven
Worked answer: The exponent leaves remainder two modulo three, giving 2²≡4.
Why it matters: A small change in the exponent can change the final residue. A clear JC2 response gives the modulus, the applicable theorem and the congruence that makes the reduction valid.
3. 2¹⁰² modulo seven
Worked answer: The exponent is divisible by three, so 2¹⁰²≡1.
Why it matters: Use a power equal to one to prove a repeating cycle. A clear JC2 response gives the modulus, the applicable theorem and the congruence that makes the reduction valid.
4. 3¹⁰⁰ modulo seven
Worked answer: The order of three is six, and 100≡4 (mod 6); hence 3⁴≡4.
Why it matters: Different bases can have different orders under the same prime modulus. A clear JC2 response gives the modulus, the applicable theorem and the congruence that makes the reduction valid.
5. 5¹⁰¹ modulo thirteen
Worked answer: Because 5²≡−1 and 5⁴≡1, the remainder is five.
Why it matters: A cycle of length four is shorter than the Fermat period twelve. A clear JC2 response gives the modulus, the applicable theorem and the congruence that makes the reduction valid.
6. 2⁶ modulo seven
Worked answer: 2⁶=64≡1, illustrating Fermat with p=7.
Why it matters: The theorem needs a prime modulus and a base not divisible by it. A clear JC2 response gives the modulus, the applicable theorem and the congruence that makes the reduction valid.
7. 3⁶ modulo seven
Worked answer: 3⁶=729=7×104+1, so the remainder is one.
Why it matters: A direct division can independently check a theorem-based result. A clear JC2 response gives the modulus, the applicable theorem and the congruence that makes the reduction valid.
8. 4⁶ modulo seven
Worked answer: Since 4³=64≡1, its sixth power also leaves remainder one.
Why it matters: A verified smaller period gives the same Fermat conclusion. A clear JC2 response gives the modulus, the applicable theorem and the congruence that makes the reduction valid.
9. 5⁶ modulo seven
Worked answer: Seven is prime and five is not a multiple of seven, so remainder one follows.
Why it matters: A formal statement of theorem conditions can shorten the numerical work. A clear JC2 response gives the modulus, the applicable theorem and the congruence that makes the reduction valid.
10. 6⁶ modulo seven
Worked answer: Six is −1 modulo seven, and an even power of −1 is one.
Why it matters: Use small or negative representatives to simplify arithmetic. A clear JC2 response gives the modulus, the applicable theorem and the congruence that makes the reduction valid.
11. 10⁶ modulo seven
Worked answer: Ten is congruent to three, so 10⁶≡3⁶≡1.
Why it matters: Congruence respects multiplication and positive integer powers. A clear JC2 response gives the modulus, the applicable theorem and the congruence that makes the reduction valid.
12. 7⁶ modulo seven
Worked answer: The result is zero, not one, because the base is divisible by seven.
Why it matters: The a^(p−1) theorem excludes zero residues. A clear JC2 response gives the modulus, the applicable theorem and the congruence that makes the reduction valid.
13. 7⁷ modulo seven
Worked answer: The remainder is zero, matching 7 itself modulo seven.
Why it matters: The a^p≡a form includes bases divisible by p. A clear JC2 response gives the modulus, the applicable theorem and the congruence that makes the reduction valid.
14. 10⁵ modulo five
Worked answer: Both 10⁵ and ten are congruent to zero modulo five.
Why it matters: The universal version works even when a is a multiple of the prime. A clear JC2 response gives the modulus, the applicable theorem and the congruence that makes the reduction valid.
15. 2⁵ modulo five
Worked answer: 32 leaves remainder two, agreeing with 2⁵≡2.
Why it matters: The theorem’s second version gives a direct divisibility identity. A clear JC2 response gives the modulus, the applicable theorem and the congruence that makes the reduction valid.
16. 3⁵ modulo five
Worked answer: 243=5×48+3, so 3⁵≡3.
Why it matters: Testing one case illustrates, but does not establish, the universal statement. A clear JC2 response gives the modulus, the applicable theorem and the congruence that makes the reduction valid.
17. 4⁵ modulo five
Worked answer: Four is −1 modulo five, so its fifth power is −1≡4.
Why it matters: Negative representatives can reduce calculation length. A clear JC2 response gives the modulus, the applicable theorem and the congruence that makes the reduction valid.
18. 5⁵ modulo five
Worked answer: The remainder is zero because the base is zero modulo five.
Why it matters: The same prime theorem handles every integer base through a^p. A clear JC2 response gives the modulus, the applicable theorem and the congruence that makes the reduction valid.
19. Inverse of three modulo seven
Worked answer: Five is the inverse because 3×5=15≡1.
Why it matters: Always check that the proposed inverse multiplies to one. A clear JC2 response gives the modulus, the applicable theorem and the congruence that makes the reduction valid.
20. Inverse of two modulo seven
Worked answer: Four is the inverse since 2×4=8≡1.
Why it matters: An inverse is a residue class rather than a decimal reciprocal. A clear JC2 response gives the modulus, the applicable theorem and the congruence that makes the reduction valid.
21. Inverse of five modulo eleven
Worked answer: Nine is the inverse since 5×9=45≡1.
Why it matters: An ordinary small multiplication may be faster than exponentiation. A clear JC2 response gives the modulus, the applicable theorem and the congruence that makes the reduction valid.
22. Inverse of four modulo seven
Worked answer: Two is the inverse since 4×2=8≡1.
Why it matters: Coprimality is the condition permitting modular cancellation. A clear JC2 response gives the modulus, the applicable theorem and the congruence that makes the reduction valid.
23. Solve 3x≡4 modulo seven
Worked answer: Multiplying by inverse five yields x≡20≡6.
Why it matters: Solve the congruence as a residue class, not just x=6. A clear JC2 response gives the modulus, the applicable theorem and the congruence that makes the reduction valid.
24. Solve 2x≡5 modulo seven
Worked answer: The inverse of two is four, so x≡20≡6.
Why it matters: Verify 2×6=12≡5 to catch mistakes. A clear JC2 response gives the modulus, the applicable theorem and the congruence that makes the reduction valid.
25. Solve 5x≡1 modulo eleven
Worked answer: Multiply by nine and obtain x≡9.
Why it matters: A modular inverse can isolate a variable by legitimate multiplication. A clear JC2 response gives the modulus, the applicable theorem and the congruence that makes the reduction valid.
26. Composite modulus nine
Worked answer: 2⁸=256≡4 modulo nine, not one.
Why it matters: Primality cannot be removed from the Fermat exponent rule. A clear JC2 response gives the modulus, the applicable theorem and the congruence that makes the reduction valid.
27. Composite modulus four
Worked answer: 3³=27≡3 modulo four, not one.
Why it matters: A nonprime modulus may invalidate a shortcut copied from the prime case. A clear JC2 response gives the modulus, the applicable theorem and the congruence that makes the reduction valid.
28. False primality converse
Worked answer: 341=11×31 is composite yet 2³⁴⁰≡1 modulo 341.
Why it matters: A successful single-base Fermat test cannot establish primality. A clear JC2 response gives the modulus, the applicable theorem and the congruence that makes the reduction valid.
29. Order of two modulo seven
Worked answer: Powers 2,4,1 establish multiplicative order three.
Why it matters: Check all smaller positive exponents before calling a period minimal. A clear JC2 response gives the modulus, the applicable theorem and the congruence that makes the reduction valid.
30. Order of three modulo seven
Worked answer: The successive powers are 3,2,6,4,5,1, so order six.
Why it matters: The guaranteed Fermat period can be the true minimal order. A clear JC2 response gives the modulus, the applicable theorem and the congruence that makes the reduction valid.
31. Order of minus one modulo seven
Worked answer: The residue −1 has order two: its square is one, but −1 itself is not.
Why it matters: Short cycles are compatible with the prime modulus theorem. A clear JC2 response gives the modulus, the applicable theorem and the congruence that makes the reduction valid.
32. Order of one modulo seven
Worked answer: One has order one because its first positive power is already one.
Why it matters: The shortest possible multiplicative order is one. A clear JC2 response gives the modulus, the applicable theorem and the congruence that makes the reduction valid.
33. Order of two modulo five
Worked answer: Its powers are 2,4,3,1; the order is four.
Why it matters: The value p−1 is sometimes sharp, not just an upper guarantee. A clear JC2 response gives the modulus, the applicable theorem and the congruence that makes the reduction valid.
34. Order of four modulo five
Worked answer: Since four is −1, its order is two.
Why it matters: Different nonzero residues modulo a prime may have different orders. A clear JC2 response gives the modulus, the applicable theorem and the congruence that makes the reduction valid.
35. Order of three modulo five
Worked answer: Powers 3,4,2,1 give order four.
Why it matters: An explicit residue table can establish a minimal period. A clear JC2 response gives the modulus, the applicable theorem and the congruence that makes the reduction valid.
36. 2¹⁰⁰⁰ modulo seven
Worked answer: 1000≡1 (mod 3), hence remainder two.
Why it matters: Once the period is proved, the size of the exponent is not important. A clear JC2 response gives the modulus, the applicable theorem and the congruence that makes the reduction valid.
37. 3¹⁰⁰⁰ modulo seven
Worked answer: 1000≡4 (mod 6), so 3⁴≡4.
Why it matters: Reduce the exponent by the period of the chosen base. A clear JC2 response gives the modulus, the applicable theorem and the congruence that makes the reduction valid.
38. Seven divides a⁷−a
Worked answer: For every integer a, Fermat’s universal form gives a⁷≡a modulo seven.
Why it matters: A theorem can establish a divisibility claim for infinitely many integers. A clear JC2 response gives the modulus, the applicable theorem and the congruence that makes the reduction valid.
39. Five divides a⁵−a
Worked answer: For every integer a, a⁵−a is a multiple of five.
Why it matters: This conclusion applies to zero and negative integers too. A clear JC2 response gives the modulus, the applicable theorem and the congruence that makes the reduction valid.
40. Seven divides 2^(3n)−1
Worked answer: Because 2³≡1, its nth power remains one for any positive integer n.
Why it matters: A single residue identity can prove an infinite family of claims. A clear JC2 response gives the modulus, the applicable theorem and the congruence that makes the reduction valid.
41. Counterexample modulo eight
Worked answer: At n=1, 2^(3n)−1=7, not divisible by eight.
Why it matters: One permitted counterexample refutes the modified universal statement. A clear JC2 response gives the modulus, the applicable theorem and the congruence that makes the reduction valid.
42. A claim about primality
Worked answer: Does a^(m−1)≡1 for one base imply m is prime? No.
Why it matters: The converse of Fermat’s theorem is false and needs a counterexample. A clear JC2 response gives the modulus, the applicable theorem and the congruence that makes the reduction valid.
43. Euler extension modulo nine
Worked answer: φ(9)=6 and 2⁶=64≡1 modulo nine.
Why it matters: Composite coprime moduli require a theorem with different hypotheses. A clear JC2 response gives the modulus, the applicable theorem and the congruence that makes the reduction valid.
44. Euler extension modulo eight
Worked answer: φ(8)=4 and 3⁴=81≡1 modulo eight.
Why it matters: Do not confuse Euler’s totient with m−1 for composite m. A clear JC2 response gives the modulus, the applicable theorem and the congruence that makes the reduction valid.
45. Inverse fails modulo six
Worked answer: The congruence 2x≡1 (mod 6) has no solution since the left side is even.
Why it matters: A nonzero residue modulo a composite modulus need not be invertible. A clear JC2 response gives the modulus, the applicable theorem and the congruence that makes the reduction valid.
46. Inverse works modulo six
Worked answer: Five is its own inverse since 25≡1 modulo six.
Why it matters: Gcd five and six is one, allowing an inverse despite a composite modulus. A clear JC2 response gives the modulus, the applicable theorem and the congruence that makes the reduction valid.
47. Permutation proof injection
Worked answer: If ar≡as modulo prime p with a nonzero, then r=s among representatives 1,…,p−1.
Why it matters: A finite injection into itself is a permutation, the key structural step. A clear JC2 response gives the modulus, the applicable theorem and the congruence that makes the reduction valid.
48. Factorial cancellation
Worked answer: (p−1)! can be cancelled modulo prime p since none of its factors is divisible by p.
Why it matters: Legal cancellation relies on invertibility of the factor. A clear JC2 response gives the modulus, the applicable theorem and the congruence that makes the reduction valid.
49. Binomial coefficients
Worked answer: For 1≤k≤p−1, prime p divides C(p,k).
Why it matters: The binomial expansion of (a+1)^p collapses modulo p. A clear JC2 response gives the modulus, the applicable theorem and the congruence that makes the reduction valid.
50. Boundary prime two
Worked answer: Every odd a satisfies a¹≡1 modulo two.
Why it matters: The smallest prime provides a valuable boundary check of the theorem. A clear JC2 response gives the modulus, the applicable theorem and the congruence that makes the reduction valid.
51. Negative integer base
Worked answer: For a=−3 and p=7, a⁷≡a still holds.
Why it matters: The universal version applies to negative and positive representatives. A clear JC2 response gives the modulus, the applicable theorem and the congruence that makes the reduction valid.
52. An exponent multiple of p−1
Worked answer: If p∤a, then a^(k(p−1))≡1 for every nonnegative integer k.
Why it matters: A proven period persists under positive integer multiples. A clear JC2 response gives the modulus, the applicable theorem and the congruence that makes the reduction valid.
53. Why one period is enough
Worked answer: If a^r≡1, then a^(qr+s)≡a^s for integers q≥0 and 0≤s<r.
Why it matters: Every exponent reduction should be justified by a proven one-congruence. A clear JC2 response gives the modulus, the applicable theorem and the congruence that makes the reduction valid.
54. No exponent cancellation at zero
Worked answer: If a≡0 modulo p, positive powers stay zero rather than cycling through one.
Why it matters: The noninvertible base is an exceptional but easy case. A clear JC2 response gives the modulus, the applicable theorem and the congruence that makes the reduction valid.
55. Divisibility reformulation
Worked answer: a^p≡a modulo prime p means p divides a^p−a.
Why it matters: Translate congruence back into a whole-integer divisibility statement when asked. A clear JC2 response gives the modulus, the applicable theorem and the congruence that makes the reduction valid.
56. One solution or all?
Worked answer: Computing a remainder is a numerical task; proving a universal congruence needs a general argument.
Why it matters: Read the verb in the question before deciding whether an example suffices. A clear JC2 response gives the modulus, the applicable theorem and the congruence that makes the reduction valid.
57. A final proof audit
Worked answer: State the prime, verify nondivisibility, prove or cite a valid exponent period, then reduce and check.
Why it matters: Precision in assumptions is as important as reducing a large power correctly. A clear JC2 response gives the modulus, the applicable theorem and the congruence that makes the reduction valid.
A seven-session tutorial and revision route
Session one starts with congruence and safe cancellation. Give the learner several linear congruences modulo prime and composite numbers. Ask whether a nonzero factor can be cancelled and why, so the later Fermat proof rests on secure modular algebra.
Session two develops Fermat’s theorem through the multiplication permutation. Have the student explain why each nonzero residue stays nonzero and why two products cannot collide modulo a prime. The cancellation of the factorial must also be explicitly justified.
Session three compares the binomial induction proof with the bijection proof. The student should identify what uses primality in each proof and explain how the versions a^p≡a and a^(p−1)≡1 fit together.
Session four concentrates on large powers. Calculate 2¹⁰⁰ modulo seven and 5¹⁰¹ modulo thirteen using both a general theorem and a verified smaller cycle. Distinguish a guaranteed period from the exact order.
Session five introduces modular inverses. Ask for inverses of two, three and five under different prime moduli, verify them by multiplication and apply them to solve linear congruences.
Session six presents two counterexamples: a base divisible by the prime, and a composite modulus nine. Ask the student to locate exactly which theorem hypothesis fails rather than simply marking an answer wrong.
Session seven offers an unfamiliar power-and-divisibility problem. The learner chooses a theorem, reduces exponents and writes the proof with conditions and conclusion. A short error log should classify incorrect inverses, invalid periods and unjustified cancellation.
Parents can ask why the base is allowed to be cancelled, what makes the modulus special and why a huge exponent can be reduced. Students who can answer in clear sentences show a deeper skill than merely obtaining the final remainder.
The immutable eduKateSG three-learner Mathematics reference near Sixth Avenue MRT describes Secondary 1 tuition, not a confirmed JC2 H3 programme. Enquire directly about current H3 Mathematics teaching availability.
Frequently asked questions
Is Fermat’s Little Theorem a separately listed H3 9820 topic?
The 2027 syllabus names congruences, modular arithmetic, mathematical proofs and bijections. Fermat’s theorem is a connected enrichment example rather than a distinct prescribed chapter.
Why does the modulus need to be prime?
The proof depends on each nonzero residue being invertible and multiplication preserving a permutation of nonzero residue classes. A composite modulus can invalidate that step.
What if the base is a multiple of the modulus?
Use a^p≡a for prime p. The a^(p−1)≡1 version requires the base not to be divisible by p.
Does p−1 give the smallest exponent period?
No. It gives a valid period for nonzero residues modulo prime p. A particular base may have a shorter multiplicative order.
How do modular inverses relate to Fermat?
For prime p and nonzero a, the residue a^(p−2) multiplies by a to give one, so it is a modular inverse.
Can a successful Fermat test prove primality?
No. Composite moduli can satisfy the congruence for particular bases. The prime-to-congruence implication does not reverse automatically.
Can calculators replace the theorem proof?
A calculator can check one remainder but does not justify a universal claim. Use the permutation or binomial argument when proof is requested.
Why learn both theorem versions?
The universal a^p≡a includes bases divisible by p, while a^(p−1)≡1 is more convenient for invertible modular powers and inverses.
Is Euler’s theorem part of the same idea?
Euler’s theorem extends the power-one statement to coprime bases under composite moduli using the totient. It is additional enrichment requiring its own conditions.
What would a tutor check first?
The prime modulus, the base’s coprimality, legal cancellation, a valid exponent period and whether the final answer matches the exact question.
Official references and related Mathematics guides
The 2027 Singapore–Cambridge H3 Mathematics (9820) syllabus explicitly includes congruence and modular arithmetic, proof, mathematical investigation and non-routine problem solving. The exercises here are original enrichment, not predictions of a particular SEAB paper.
For connected mathematics, read modular arithmetic and divisibility, simultaneous congruences, and mathematical induction and pigeonhole reasoning. The transferable habit is to prove the condition allowing a shortcut before using it.