eduKate Singapore

VIEW THIS AS

Auto mode follows the Route Engine until you choose a viewpoint.

YOU ARE HERE

ROUTE CHECK

CONNECTED TO

WHAT NEXT

Use the canonical route for this room, or HELP if you are unsure.

Next useful routeCanonical hubHELP

Mathematics in Bukit Timah | Chinese Remainder Theorem, Congruences and Repeating Cycles

—

by

eduKate Asia
Illustration of two students discussing mathematical reasoning with square tiles and a notebook.

Did you know that three different remainders can determine a number even when you do not know the number itself? A fictional puzzle says a positive integer leaves remainder two when divided by three, remainder three when divided by five, and remainder two when divided by seven. The smallest solution is 23. Every other solution is 23 plus a whole multiple of 105. This is an example of the Chinese remainder theorem.

This Mathematics in Bukit Timah guide teaches congruence notation, modular arithmetic, modular inverses, simultaneous remainder conditions, coprimality, least common multiples, noncoprime cases, repeating cycles and constructive proofs. All timers, tokens, books and timetable-like examples are invented. None of the numbers represents an actual Bukit Timah transport timetable, school schedule, security code, password or real device cycle. The purpose is to show how exact reasoning turns several partial clues into a precise mathematical answer.

Quick answer: If positive moduli m₁,…,mₖ are pairwise coprime, a system x≡aᵢ (mod mᵢ) has exactly one solution class modulo M=m₁m₂⋯mₖ. For x≡2 (mod3), x≡3 (mod5), x≡2 (mod7), the solutions are x≡23 (mod105). “One solution class” means infinitely many integers differing by multiples of 105, not one solitary integer.

Article contents

Original 2026 Mathematics classroom illustration accompanying fictional Chinese remainder theorem, modular congruences and repeating-cycle puzzles.

Start with the language of remainders

When integer x is divided by a positive integer m, its remainder can be chosen from 0 through m−1.

Writing x≡r (mod m) means that m divides x−r. The symbol ≡ is a congruence relation, not an ordinary equality sign.

For example 23≡2 (mod3) because 23−2=21, divisible by three.

Why Bukit Timah is only the learning context

A learner near Sixth Avenue, Beauty World or King Albert Park may encounter puzzles involving clocks, repeating events and number patterns.

But the cycles below are mathematical inventions. They do not describe service frequencies, examination schedules or real local operating hours.

A congruence can calculate exactly when fictional cycles align; using it to promise a real arrival time would require verified schedules and operational information.

Worked example 1: check three remainders

Calculate 23 divided by three: 23=3×7+2, remainder two.

Divide 23 by five: 23=5×4+3, remainder three.

Divide 23 by seven: 23=7×3+2, remainder two. Therefore 23 satisfies all three congruences simultaneously.

A congruence describes a family of integers

The statement x≡2 (mod3) includes

…,−4,−1,2,5,8,11,14,17,20,23,…

Every listed number differs from two by a multiple of three. The notation describes an entire residue class rather than one ordinary value.

Choosing the least nonnegative representative is a convention that makes the answer concise.

Worked example 2: list one residue class

For x≡3 (mod5), possible integers include …,−7,−2,3,8,13,18,23,28,…

The general form is x=5k+3, where k is an integer.

The variable k may be positive, zero or negative. It is not restricted to positive values unless the original problem imposes such a restriction.

Two congruences are an intersection of classes

Consider x≡1 (mod4) and x≡3 (mod5).

The first gives x=…,1,5,9,13,17,… . The second gives x=…,3,8,13,18,…

Their common values include 13,33,53,… and negative corresponding values. This suggests x≡13 (mod20).

Worked example 3: verify the small system

Divide 13 by four to get remainder one.

Divide 13 by five to get remainder three.

Adding twenty preserves both remainders because 20 is divisible by four and by five. Thus all integers 13+20k satisfy the two conditions.

Why the least common multiple appears

If x and y both solve a remainder system, their difference is divisible by every modulus.

Therefore the difference must be divisible by the least common multiple of those moduli.

For moduli four and five, the least common multiple is 20. Thus any solutions differ by multiples of 20, giving the natural repeat period.

Pairwise coprime means every pair has greatest common divisor one

Integers three, five and seven are pairwise coprime because each pair has greatest common divisor one.

The same is true of four and nine, since gcd(4,9)=1, even though neither is prime.

The Chinese remainder theorem does not require every modulus itself to be prime. Pairwise coprimality is the key condition for the simple product-period version.

Worked example 4: composite but coprime

Consider x≡1 (mod4) and x≡2 (mod9).

The moduli four and nine share no common divisor greater than one, so there is one solution class modulo 36.

Try x=29: 29 mod4=1 and 29 mod9=2. Therefore x≡29 (mod36) solves the system.

The product period is exact under coprimality

If m and n are coprime, their least common multiple is mn.

Any two simultaneous solutions differ by a multiple of both m and n, hence by a multiple of mn.

The theorem also guarantees that a simultaneous solution exists for every pair of specified residues. Combining existence and the period condition gives uniqueness modulo mn.

Worked example 5: compare moduli three and seven

Take x≡2 (mod3) and x≡4 (mod7).

The product period is 21 because gcd(3,7)=1.

One solution is eleven: 11 mod3=2 and 11 mod7=4. Thus x≡11 (mod21).

One way to solve is substitution

For x≡1 (mod4), write x=4k+1.

The second condition x≡3 (mod5) then becomes 4k+1≡3 (mod5), so 4k≡2 (mod5).

Because 4≡−1 (mod5), this gives −k≡2, or k≡3 (mod5).

Worked example 6: finish substitution

Take k=3+5t.

Then x=4(3+5t)+1=13+20t.

Therefore the solution is x≡13 (mod20). This reproduces the earlier answer through algebra instead of looking for the first matching number.

Modular inverses undo multiplication

For integers a and positive m with gcd(a,m)=1, a has a multiplicative inverse modulo m.

That inverse is a number b satisfying ab≡1 (mod m).

The inverse lets us solve a congruence ax≡c (mod m) by multiplying by b. Division is not performed as ordinary fractions; it is multiplication by a valid modular inverse.

Worked example 7: inverse of three modulo seven

Find b such that 3b≡1 (mod7).

Try b=5: 3×5=15, and 15≡1 (mod7).

Thus 3⁻¹≡5 (mod7). This means five is the inverse class of three, not that the real-number reciprocal 1/3 equals five.

Worked example 8: solve a linear congruence

Solve 3x≡4 (mod7).

Multiply both sides by inverse five: x≡5×4=20≡6 (mod7).

Check: 3×6=18, which leaves remainder four modulo seven. The solution class is correct.

The inverse exists only for coprime multiplier and modulus

If gcd(a,m)>1, the multiplier a has no inverse modulo m.

For example two has no multiplicative inverse modulo six, because 2b is always even and cannot be congruent to one modulo six.

One must not “divide by two modulo six” as though ordinary cancellation were automatically valid.

Worked example 9: an unsolvable congruence

Consider 2x≡1 (mod6).

The left side is always even, while numbers congruent to one modulo six are odd.

There is no integer solution. Equivalently, gcd(2,6)=2 does not divide the right-hand side one.

A noncoprime linear congruence can still have solutions

Consider 6x≡4 (mod10).

The greatest common divisor gcd(6,10)=2 divides four. Divide the entire congruence correctly by this common factor to obtain

3x≡2 (mod5).

Now three has an inverse modulo five, so this reduced system can be solved.

Worked example 10: find all solutions modulo ten

The inverse of three modulo five is two, since 3×2=6≡1.

Thus x≡2×2=4 (mod5). Within residues 0 through 9, the solutions are x=4 and x=9.

Check 6×4=24≡4 (mod10), and 6×9=54≡4 (mod10). Noncoprimality changed the count of solution residues.

The Chinese remainder theorem is constructive

The theorem does not merely guarantee that an answer exists. It gives a systematic way to build one using modular inverses.

For pairwise coprime moduli, multiply all moduli to obtain M.

For each modulus mᵢ, define Mᵢ=M/mᵢ. Then find an inverse of Mᵢ modulo mᵢ, and combine the weighted terms.

The constructive formula

Given x≡aᵢ (mod mᵢ) with pairwise coprime mᵢ, let M be their product.

Choose uᵢ satisfying Mᵢuᵢ≡1 (mod mᵢ), where Mᵢ=M/mᵢ.

Then x≡Σ aᵢMᵢuᵢ (mod M). Each term contributes the desired residue to one modulus and vanishes modulo all the others.

Our three-modulus puzzle

We want

x≡2 (mod3), x≡3 (mod5), x≡2 (mod7).

The product is M=3×5×7=105.

The partial products are M₁=35, M₂=21 and M₃=15. Next compute their inverses in the corresponding moduli.

Worked example 11: inverse for modulus three

M₁=35. Modulo three, 35≡2.

The inverse of two modulo three is also two, because 2×2=4≡1.

Thus u₁=2. The first contribution is a₁M₁u₁=2×35×2=140.

Worked example 12: inverse for modulus five

M₂=21. Modulo five, 21≡1.

The inverse of one is one, so u₂=1.

The second contribution is a₂M₂u₂=3×21×1=63.

Worked example 13: inverse for modulus seven

M₃=15. Modulo seven, 15≡1.

Its inverse is one, so u₃=1.

The third contribution is a₃M₃u₃=2×15×1=30.

Combine the contributions

Add 140+63+30=233.

Reduce modulo 105: 233−2×105=23.

Therefore x≡23 (mod105). The answer follows from modular inverse construction rather than relying on a lucky search through consecutive integers.

Worked example 14: verify the construction

The resulting number 23 has remainders two modulo three, three modulo five, and two modulo seven.

Furthermore, the constructed number 233 also has those same remainders, since 233−23=210 is divisible by all three moduli.

The method finds a solution class, not a unique representative before reduction.

Why the terms do not interfere

Consider the term M₁u₁=35×2=70.

Modulo three, it is congruent to one, so multiplying by a₁ supplies residue a₁. Modulo five and seven, it is zero because 35 is divisible by those moduli.

The other constructed basis terms have the analogous property. Each one selects a single residue component.

This resembles interpolation in a different algebraic system

The Chinese remainder construction builds special integer expressions that equal one in one residue system and zero in the others.

Lagrange interpolation builds polynomial basis functions that equal one at one node and zero at other nodes.

The settings differ—modular rings versus polynomial values—but the “isolate one constraint, then add contributions” structure is a useful conceptual comparison.

Prove uniqueness modulo the product

Suppose x and y both satisfy all congruences with pairwise coprime moduli.

Then mᵢ divides x−y for every i. Since the moduli are pairwise coprime, their product M divides x−y.

Therefore x≡y (mod M). The theorem’s constructive formula supplies existence, while this argument supplies uniqueness of the residue class.

Worked example 15: list more solutions

Our solution class is x=23+105k.

For k=0, x=23. For k=1, x=128. For k=2, x=233.

All satisfy the same three remainders. If only positive values below one hundred are allowed, 23 is the sole permitted answer; that restriction comes from the problem domain.

Least positive and least nonnegative differ in some cases

If a congruence system has solution class zero modulo M, then its least nonnegative representative is zero.

But its least positive representative is M.

A worksheet may ask for a “smallest positive integer” or “smallest nonnegative integer.” Read the boundary condition before reporting the representative.

Worked example 16: a zero-class example

Solve x≡0 (mod4) and x≡0 (mod5).

The solution class is x≡0 (mod20).

The smallest nonnegative solution is 0. The smallest strictly positive solution is 20. The congruence class is identical in both answers.

Coprimality is about pairs, not just the group gcd

Three numbers can have overall gcd one without being pairwise coprime.

For example moduli 6,10,15 have gcd(6,10,15)=1, but gcd(6,10)=2.

Therefore the simple CRT product-period theorem does not automatically apply. The product 900 is not the least common multiple of those moduli.

Worked example 17: distinguish gcd conditions

Take moduli 6,10,15.

Overall gcd is one, but the pairs share factors 2,3 or 5.

Their least common multiple is 30, not 6×10×15=900. A simultaneous residue system, if compatible, repeats modulo thirty.

Noncoprime systems need compatibility checks

For x≡a (mod m) and x≡b (mod n), a simultaneous solution exists exactly when a≡b (mod gcd(m,n)).

Equivalently, their residue difference a−b must be divisible by gcd(m,n).

When a solution exists, it forms one class modulo lcm(m,n), not necessarily the product mn.

Worked example 18: a compatible noncoprime pair

Solve x≡1 (mod4) and x≡3 (mod6).

The modulus gcd is two, and the residue difference is 3−1=2, divisible by two.

Try x=9: it leaves remainder one modulo four and three modulo six. The solution is x≡9 (mod12) because lcm(4,6)=12.

Worked example 19: an incompatible pair

Solve x≡1 (mod4) and x≡2 (mod6).

The gcd of the moduli is two, but the residue difference 2−1=1 is not divisible by two.

There is no integer solution. One condition requires x odd, while the other requires x even. The contradiction can be seen without listing numbers.

Why a least common multiple is the combined period

For compatible moduli, adding their least common multiple preserves both remainders.

With four and six, the least common multiple is twelve. If x=9 works, then 9+12=21 also works, and so does 9−12=−3.

The solutions form one residue class modulo twelve. Their repetition is not governed by 24 unless that happens to be a nonminimal period one chooses to use.

A fictional clock-cycle puzzle

Imagine a token starts at time step zero and two independent display counters repeat every eight and twelve steps.

A clue says the unknown step is congruent to one modulo eight and to five modulo twelve.

Because the moduli share gcd four, check compatibility: 5−1=4, divisible by four. A solution exists.

These are invented counter cycles, not service arrival times.

Worked example 20: solve eight and twelve cycles

We want x≡1 (mod8), x≡5 (mod12).

Try x=17: 17 mod8=1, and 17 mod12=5.

The least common multiple is 24, so x≡17 (mod24). Every 24 steps the same pair of counter positions recurs.

Real schedules require more than modular arithmetic

A mathematical cycle presumes exact repetition forever at the stated period.

Actual public services may have disruptions, timetable changes, start offsets, nonuniform intervals or day-specific rules.

Therefore modular congruences cannot confirm an actual Bukit Timah bus or train arrival without verified service data. The numbers in our puzzle remain fictional.

Congruences can be added safely

If a≡b (mod m) and c≡d (mod m), then a+c≡b+d (mod m).

The difference between the sums is (a−b)+(c−d), a sum of multiples of m.

The same principle works for subtraction and multiplication. It makes modular calculations efficient without changing the underlying integer classes.

Worked example 21: reduce before multiplying

Compute the remainder of 37×29 modulo five.

Since 37≡2 (mod5) and 29≡4 (mod5), the product is congruent to 2×4=8≡3 (mod5).

Direct multiplication gives 1073, which also leaves remainder three. Reducing early simplifies arithmetic.

Cancellation needs coprimality or a proper reduction

From 2x≡2y (mod6), one cannot always cancel two to obtain x≡y (mod6).

The correct consequence is x≡y (mod3) after dividing the modulus and both sides by the common divisor two.

For example x=1,y=4 satisfy 2x≡2y (mod6) because 2≡8, but 1 and 4 are not congruent modulo six.

Worked example 22: check the cancellation counterexample

Let x=1,y=4.

2x=2 and 2y=8, both remainder two modulo six.

However x−y=−3 is not divisible by six. It is divisible by three. The reduced modulus captures the valid inference.

Modulo a negative number is avoidable here

In ordinary elementary number theory, choose a positive modulus m.

Represent residues by 0 through m−1 when a least nonnegative answer is required.

Negative representatives such as −1 may still be congruent to positive residues; for example −1≡4 (mod5). The congruence class is the important object.

Worked example 23: convert a negative representative

The number −8 modulo five can be represented by remainder two because −8−2=−10, divisible by five.

Thus −8≡2 (mod5).

Adding ten to −8 gives the least nonnegative representative two. This is often more convenient than reporting a negative remainder.

Three congruences can be solved in stages

The CRT formula is systematic, but pairwise substitution can also work.

First solve the conditions modulo three and five. That gives one class modulo fifteen.

Then combine that class with the condition modulo seven. Because fifteen and seven are coprime, the last step produces one class modulo 105.

Worked example 24: combine the first two

Find x≡2 (mod3) and x≡3 (mod5).

The number eight satisfies both, and the period is fifteen. Therefore x≡8 (mod15).

Now write x=15k+8 and require x≡2 (mod7). Then 15k+8≡k+1≡2, so k≡1 (mod7). Therefore x≡23 (mod105).

The same problem can have many valid solving methods

A small system may be easiest by listing candidates. A medium system may be solved by substitution.

The constructive CRT method is especially systematic when several pairwise coprime moduli are involved.

All correctly executed methods should produce equivalent residue classes. Different representatives are not contradictory if they differ by the combined period.

Mathematical invariants help verify solutions

A candidate x must satisfy every original congruence, not merely the last one solved.

A final answer should also state the correct repetition modulus.

For x=23, checking moduli three, five and seven is straightforward and guards against a sign or inverse mistake in the construction.

The generalized CRT uses compatible residues

For several positive moduli that are not pairwise coprime, a solution exists when the residues agree modulo the greatest common divisor for each pair of moduli.

When compatible, the solution is unique modulo the least common multiple of the moduli.

This is a generalization of the pairwise coprime theorem, not a claim that every arbitrary remainder list has a solution.

Worked example 25: a three-condition compatible case

Consider x≡1 (mod4), x≡3 (mod6), x≡1 (mod5).

From the first two, x≡9 (mod12). Require 9+12k≡1 (mod5): 4+2k≡1, so 2k≡2 and k≡1 (mod5).

Thus x≡21 (mod60). Check: 21 mod4=1, mod6=3, mod5=1.

The theorem can be framed as reconstruction

A number modulo M can be reconstructed from its residues modulo pairwise coprime factors of M.

For M=105, the three residues modulo 3,5,7 together identify one class modulo 105.

This viewpoint appears in computational arithmetic, but reconstructing a number from residues is not equivalent to encrypting it or keeping information secret.

Security is a different question

The existence of modular inverses and remainder reconstruction is foundational Mathematics used in many technical fields.

A remainder puzzle does not by itself create a secure cipher, authentication system or private storage method.

Security claims require separately specified algorithms, assumptions and threat models. Our examples are open mathematical exercises.

An algorithm can solve large modular systems

Efficient implementations use the extended Euclidean algorithm to find inverses and combine congruences.

The arithmetic may involve large integers, but the core logic remains divisibility, inverse construction and reduction modulo the combined period.

A calculator or computer can verify residues, yet the proof of uniqueness comes from number theory, not from trying many numerical candidates.

Worked example 26: Euclidean algorithm for an inverse

Find the inverse of 7 modulo 26.

Use Euclidean steps: 26=3×7+5; 7=1×5+2; 5=2×2+1.

Back-substitute 1=5−2×2=5−2(7−5)=3×5−2×7=3(26−3×7)−2×7=3×26−11×7.

Thus −11×7≡1 (mod26), so inverse is 15, because −11≡15 (mod26). Check 7×15=105≡1.

The extended Euclidean algorithm is not trial-and-error

The calculations express the greatest common divisor as a linear combination of the original integers.

When gcd(a,m)=1, they produce integers u,v satisfying au+mv=1.

Reducing modulo m gives au≡1, so u is the inverse of a. This explains why the algorithm works.

Coprime products and the pigeonhole idea

For pairwise coprime moduli with product M, there are exactly M possible residue combinations: m₁ choices for the first, m₂ for the second, and so forth.

There are also exactly M residue classes modulo M.

CRT’s construction matches every residue combination to one class. This is a structural one-to-one correspondence, not merely a lucky numerical coincidence.

Worked example 27: count the residue combinations

For moduli three, five and seven, there are 3×5×7=105 possible triples of residues.

There are 105 residue classes modulo 105.

CRT says that every triple occurs for exactly one of those residue classes. Our triple (2,3,2) corresponds to class 23.

Avoid confusing modulo arithmetic with decimal digits

The value x≡3 (mod5) means the remainder after division by five is three.

It does not say x ends with decimal digit three. For example x=8 also has remainder three modulo five.

Decimal last-digit rules are themselves specific modular facts, not interchangeable with every remainder system.

Worked example 28: same remainder, different last digit

Consider x=8 and x=13.

Both satisfy x≡3 (mod5), since they differ by five.

Yet their decimal last digits are eight and three. A modular remainder class can include different decimal endings.

A remainder constraint is exact only under its premises

If an invented device is said to repeat every eight steps, one may write a period-eight congruence.

If its actual cycle occasionally changes, that exact congruence is no longer a valid model of all observed times.

Good mathematical problem solving separates deductions from stipulated rules from evidence that those rules hold in a real process.

Common error 1: confuse equality with congruence

Writing x≡23 (mod105) does not mean x=23 exclusively.

All values 23+105k are congruent to 23.

The correction is to identify the full solution class, then select a representative only when the problem restricts the range.

Common error 2: multiply noncoprime moduli blindly

For compatible congruences modulo four and six, the combined period is twelve, not 24.

The simple product period applies only when the moduli are coprime.

Check greatest common divisors and least common multiples before claiming uniqueness modulo a product.

Common error 3: claim every noncoprime system is impossible

Noncoprime moduli can still have compatible residues.

For x≡1 (mod4) and x≡3 (mod6), the solution class x≡9 (mod12) exists.

The correct test is whether the residue difference is divisible by gcd(4,6)=2.

Common error 4: divide modulo a composite number without an inverse

The congruence 6x≡4 (mod10) cannot be solved by multiplying by an inverse of six modulo ten, because that inverse does not exist.

Reduce properly by their gcd two and solve modulo five.

Unjustified cancellation is a common source of missing or false solution classes.

Common error 5: reduce the wrong sum in the CRT formula

The constructive result 233 must be reduced modulo M=105, not merely modulo three, five or seven individually.

Reducing modulo a single small factor loses the other residue conditions.

Report x≡23 (mod105) and check all three remainders.

Common error 6: mix the moduli and their inverse factors

For each modulus mᵢ, the inverse uᵢ belongs to Mᵢ modulo that same mᵢ.

Using the inverse found for the modulus five term inside the modulus three contribution can spoil the isolation property.

Label the terms Mᵢ,uᵢ,aᵢ in a table before adding contributions.

Common error 7: present fictional cycles as real timetable predictions

Repeating clocks can be modelled with exact remainders.

Real vehicles or classes may not follow unchanging exact cycles and may have external constraints.

A local-themed article should not assert any specific actual arrival or start time from invented period numbers.

Primary readiness: division and remainders

Primary learners can divide small numbers, describe remainders and notice repeating patterns on a number track.

They can solve a simple two-remainder riddle by listing candidates without formal modular inverses.

This builds the intuition that several partial clues can narrow a search.

Lower Secondary: factors, LCM and algebraic substitution

Secondary students can write x=mk+r, compare two conditions and calculate their combined repetition using the LCM.

They can develop congruence notation and understand that two solutions may differ by a full period.

The generalized CRT and inverse algorithm are enrichment following confidence with integer algebra and divisibility.

Advanced number-theory pathways

The Chinese remainder theorem, modular inverses and Euclidean algorithm connect school number properties with higher discrete Mathematics.

Consult the SEAB 2027 G3 Mathematics syllabus directory for actual examinable school prerequisites and the 2027 A-Level syllabus directory for further routes.

This article does not claim full CRT construction or generalized congruence solving is required of every Secondary learner.

A twenty-minute family diagnostic

Minutes 1–5: Solve x≡1 (mod4) and x≡3 (mod5) by listing values, identifying 13.

Minutes 6–10: Write x=4k+1, solve for k modulo five, and derive x≡13 (mod20).

Minutes 11–15: For moduli 3,5,7, construct partial products 35,21,15 and their inverses, recovering x≡23 (mod105).

Minutes 16–20: Compare compatible x≡1 (mod4), x≡3 (mod6) with incompatible x≡1 (mod4), x≡2 (mod6). Explain the gcd test.

Seven days of practice

Day one revises quotient-and-remainder division. Day two learns residue classes and LCM.

Day three solves two coprime congruences by substitution. Day four finds modular inverses. Day five constructs three-modulus solutions.

Day six examines compatible and incompatible noncoprime systems. Day seven explains uniqueness, verifies all original remainders and states real-world modelling limits.

Practice questions with checked answers

A. Remainder of 23 divided by three? Answer: 2.

B. Solve x≡1 (mod4), x≡3 (mod5). Answer: x≡13 (mod20).

C. Inverse of three modulo seven? Answer: 5.

D. Solve 3x≡4 (mod7). Answer: x≡6 (mod7).

E. Solve the triple residues 2 mod3, 3 mod5, 2 mod7. Answer: x≡23 (mod105).

F. Solve x≡1 (mod4), x≡3 (mod6). Answer: x≡9 (mod12).

G. Does x≡1 (mod4), x≡2 (mod6) have a solution? Answer: no.

H. Solve 6x≡4 (mod10). Answer: x≡4 (mod5), or residues four and nine modulo ten.

Frequently asked questions

What does x congruent to r modulo m mean?

It means x−r is divisible by positive integer m, so x and r have the same remainder after division by m.

What does the Chinese remainder theorem guarantee?

For pairwise coprime moduli, every set of prescribed residues determines exactly one solution class modulo their product.

Does the theorem require prime moduli?

No. The moduli need to be pairwise coprime for the simple product version; they do not each need to be prime.

Is there only one integer solution?

No. There is one residue class, containing infinitely many integers separated by the combined period.

What if the moduli are not coprime?

Solutions may still exist if residues satisfy the necessary gcd compatibility conditions; the repeat period is then their LCM.

Why do modular inverses matter?

They allow multiplicative coefficients to be undone when coprime to the modulus and enable constructive CRT solutions.

Is modular cancellation always valid?

No. Cancellation requires appropriate coprimality or a corresponding reduction of the modulus.

Can CRT predict actual Bukit Timah transport arrival times?

Not from invented periods. Real arrival predictions require verified schedules and conditions.

Is this a standard Primary topic?

Remainder patterns are accessible earlier, but formal CRT proof and inverse methods are advanced enrichment.

How can parents recognise mastery?

The learner can solve by two independent methods, check all congruences, identify the correct period and distinguish coprime from compatible noncoprime cases.

Sources and connected Mathematics in Bukit Timah

For applicable Singapore course requirements, consult the SEAB 2027 G3 Mathematics syllabus directory and the 2027 A-Level syllabus directory. Every cycle and remainder here is fictional teaching material.

Read Modular Arithmetic and Check Digits, Repeating Events and LCM, Binary Numbers and Digital Patterns, Proof and Counterexamples and Hamming Parity Checks for related skills.

The immutable Clementi Secondary 1 Mathematics small-group reference anchors explanations from first principles, carefully checked working, misconception diagnosis and independent transfer.

The lasting habit is to translate each clue into a congruence, check greatest common divisors, construct a solution under valid inverse conditions and verify every remainder before choosing the least positive representative.

Companion Mathematics in Bukit Timah articles in this new four-part batch: Bézier Curves, Control Points and Smooth Geometric Design · Graph Isomorphism, Degree Sequences and Network Symmetry · Separable Differential Equations, Growth, Decay and Equilibrium. These new lessons extend parametric curve design, simultaneous modular constraints, network structural equivalence and calculus models, with original worked examples and explicit assumptions.