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

Secondary 2 G3 Mathematics Tutor Bukit Timah | Remainders Divisibility and Modular Number Patterns

—

by

eduKate Asia
Three students work together at a classroom table, reviewing open textbooks and notes.

Secondary 2 G3 Mathematics Tutor Bukit Timah | Remainders Divisibility and Modular Number Patterns. Did you know? If today is Thursday, a date 100 days later has the same weekday as a date only two days later, because 100 leaves remainder two when divided by seven. This is a useful example of arithmetic that focuses on what remains after complete groups have been removed.

This reader-first Secondary 2 G3 Mathematics guide explains remainders, divisibility tests, repeating digit patterns, simple clock arithmetic, even and odd structure, and equations involving whole-number remainders. It is designed for Bukit Timah pupils who want to understand the mathematics behind patterns rather than memorise isolated answers. Formal modular notation is an optional enrichment tool; a school’s current year-level assessment list takes priority.

The central question is: ‘After putting a quantity into equal groups, what remains?’ That single idea connects clock faces, week cycles, parity and last-digit patterns. We will represent each case precisely, check assumptions about whole numbers, and avoid pretending a real schedule or date can be deduced when its starting point is missing.

Find the remainder or cycle you need

Quick answer: the quotient and remainder must be valid

For a whole number a divided by a positive whole-number divisor n, write a = nq + r, where q is a whole-number quotient and the remainder satisfies 0 ≤ r < n. For example, 29=5×5+4, so 29 leaves remainder 4 when divided by 5. Two integers have the same remainder after division by n when their difference is a multiple of n.

The compact notation a ≡ r (mod n) means that a and r have the same remainder modulo n. This does not mean a=r as ordinary numbers. For example 29 ≡ 4 (mod 5) but 29 is not equal to 4. Students can learn the reasoning first and adopt the notation only when it helps.

Why the remainder is smaller than the divisor

If the divisor is five, a remainder of six cannot be final: it contains another complete group of five and leaves one. That is why the conventional nonnegative remainder is one of 0,1,2,3 or4. An answer of remainder five also means another group fits exactly, so its true remainder is zero.

For 29 divided by five, five complete groups give25, leaving four. A calculator may show29/5=5.8; the decimal0.8 is not the integer remainder. Multiply its fractional part by divisor five to recover four, but the integer-division equation is clearer and avoids rounding.

A remainder can also be found from a nearby multiple

To find 1,003 divided by seven, note 7×143=1,001, so the remainder is 2. There is no need to perform long division if a nearby multiple is easy to recognise. The same strategy works for finding what remains after a repeated cycle.

If the problem asks for a number congruent to −1 modulo seven, then six is its conventional remainder because −1+7=6. Signed integers can have standard nonnegative remainders, but their quotient convention should be clearly stated when introducing negative examples to a younger learner.

Addition and multiplication preserve remainder patterns

Suppose a leaves remainder two on division by five, and b leaves remainder four. Then a+b leaves the same remainder as 2+4=6, which reduces to one. Multiplying the numbers gives a product with the same remainder as 2×4=8, which reduces to three. This works because the omitted full multiples of five remain multiples after addition or multiplication.

This is why a large expression can often be reduced before a calculation. If 103 and 97 are considered modulo ten, their final digits are three and seven, so their product has final digit one because 3×7=21. The result 9,991 verifies that final digit.

How weekday arithmetic uses seven

There are seven days in a weekly cycle. A whole number of seven-day blocks returns to the starting weekday, so only the remainder after division by seven matters. A date 100 days later is two weekdays ahead, because100=7×14+2. If the starting weekday is Thursday, that means Saturday.

Do not confuse ‘100 days later’ with a year-to-date calendar calculation if the starting date or time zone is not supplied. This section is purely about a mathematical seven-day cycle from a known day. The tool to find actual holiday dates or local time is a different task.

A 12-hour clock provides another remainder model

A twelve-hour dial repeats after twelve hours. Starting at the mark 9, a shift of five hours gives14, which wraps to mark2. In modular arithmetic, 9+5=14 and14 leaves remainder2 modulo twelve. On the actual twelve-hour clock, the mark12 represents remainder zero, not a literal printed zero.

This is one reason to distinguish a displayed clock label from the underlying remainder. A 24-hour digital display uses a different cycle, while day names use seven. Choose the correct modulus for the question’s stated periodic system.

Last digits are simply remainders modulo ten

The last digit of a nonnegative whole number is its remainder on division by ten. For powers of two, the final digits repeat in a cycle: 2,4,8,6, then2 again. To find the last digit of 2²⁵, note25 leaves remainder one when divided by four, so the cycle returns to2.

This is an application of pattern recognition, not a licence to assume every sequence has the same cycle length. Powers of three, seven and nine have their own patterns. List at least one complete cycle and verify it repeats through multiplication by the base.

Divisibility tests have mathematical reasons

A number is divisible by three if its digit sum is divisible by three because ten leaves remainder one modulo three. Every power of ten therefore also leaves remainder one, so a base-ten number has the same remainder as the sum of its digits. The same argument works for nine.

A number is divisible by eleven when the alternating sum of its decimal digits is a multiple of eleven. For example 1,001 has alternating sum 1−0+0−1=0 and is divisible by eleven (1,001=11×91). This test can be useful extension; first secure more familiar tests for two, three, five and ten.

One equation with a remainder may leave several answers

Suppose a positive whole number n leaves remainder two when divided by five. It can be written n=5k+2 for a nonnegative integer k, giving 2,7,12,17,… . That condition alone does not fix one n. If another condition says n is less than 20, the possible values are2,7,12,17.

If the question adds that n is divisible by three, test the candidates or use the expression. Among those four values, 12 is divisible by three, so n=12 is the unique answer under the stated bounds. Be careful to use the word ‘unique’ only after all conditions have been checked.

Where formal modular arithmetic is extension rather than immediate syllabus

The language of remainders, patterns and divisibility draws directly on familiar whole-number Mathematics. Formal congruence notation and more advanced modular proofs are not necessarily part of a Secondary 2 G3 weighted assessment. Present them to curious learners only after the arithmetic relationships and the school’s own topic sequence are secure.

A tutor should keep the main lesson on thinking clearly: identify divisor, identify cycle length, write valid remainder range, and check the original number or pattern. A formal symbol is valuable only if it makes that reasoning easier.

A six-step number-pattern method

  • Identify the positive whole-number divisor or cycle length and state the domain of the unknown.
  • Write a=nq+r, ensuring the remainder r is from zero up to one less than n.
  • For large powers, build a small trustworthy table of early outcomes and identify a repeat cycle.
  • Use the remainder to answer the actual question, such as final digit or weekday offset.
  • When multiple conditions are stated, intersect the possible integer sets rather than choosing one satisfying only the first.
  • Check the proposed answer by actual division or by stepping through the original cycle for a smaller analogous input.

Forty-eight original remainder and number-pattern clinics

Twenty-nine divided by five

Number-pattern question. Find quotient and remainder of29÷5.

Worked result. 29=5×5+4, so quotient5 and remainder4.

Why this remainder rule applies. Remainder is less than divisor5. The full multiples of the divisor do not affect the final remainder, but the divisor and domain must remain the same throughout.

First misconception. 5.8 is a decimal quotient, not remainder0.8.

Independent check. 5×5+4=29. A complete answer states the conventional remainder and explains the relevant cycle or divisibility condition, not just an unexplained numeral.

A perfect multiple

Number-pattern question. Divide35 by7 and give remainder.

Worked result. 35=7×5+0, remainder0.

Why this remainder rule applies. Divisibility means nothing is left after full groups. The full multiples of the divisor do not affect the final remainder, but the divisor and domain must remain the same throughout.

First misconception. A remainder7 would represent another full group.

Independent check. 35/7=5 exactly. A complete answer states the conventional remainder and explains the relevant cycle or divisibility condition, not just an unexplained numeral.

Find a nearby multiple

Number-pattern question. Find remainder when1003 is divided by7.

Worked result. 7×143=1001, leaving2.

Why this remainder rule applies. Nearby multiples avoid long division. The full multiples of the divisor do not affect the final remainder, but the divisor and domain must remain the same throughout.

First misconception. 7×144=1008 is above the target.

Independent check. 1003=1001+2. A complete answer states the conventional remainder and explains the relevant cycle or divisibility condition, not just an unexplained numeral.

Remainder less than divisor

Number-pattern question. Can division by6 have remainder8?

Worked result. Not in conventional quotient-remainder form; 8 reduces to remainder2 with one extra group of6.

Why this remainder rule applies. Final remainder must be 0 through5. The full multiples of the divisor do not affect the final remainder, but the divisor and domain must remain the same throughout.

First misconception. Calling8 the remainder ignores a complete group.

Independent check. 8=6+2. A complete answer states the conventional remainder and explains the relevant cycle or divisibility condition, not just an unexplained numeral.

Equal remainder examples

Number-pattern question. Do17 and29 have the same remainder mod6?

Worked result. Both leave5; 17=12+5 and29=24+5.

Why this remainder rule applies. Their difference12 is multiple6. The full multiples of the divisor do not affect the final remainder, but the divisor and domain must remain the same throughout.

First misconception. Equal remainder does not mean equal original numbers.

Independent check. 29−17=12. A complete answer states the conventional remainder and explains the relevant cycle or divisibility condition, not just an unexplained numeral.

Another congruence

Number-pattern question. Are14 and32 congruent modulo9?

Worked result. Yes; both leave5 and difference18 is multiple9.

Why this remainder rule applies. Whole multiples of9 do not change remainder. The full multiples of the divisor do not affect the final remainder, but the divisor and domain must remain the same throughout.

First misconception. Simply comparing size cannot settle congruence.

Independent check. 14=9+5,32=27+5. A complete answer states the conventional remainder and explains the relevant cycle or divisibility condition, not just an unexplained numeral.

Addition of remainders

Number-pattern question. a leaves2 mod5, b leaves4 mod5; what does a+b leave?

Worked result. 2+4=6, so remainder1 mod5.

Why this remainder rule applies. Full multiples of5 contribute zero to final remainder. The full multiples of the divisor do not affect the final remainder, but the divisor and domain must remain the same throughout.

First misconception. Remainder6 must be reduced again.

Independent check. Take a=7,b=9: sum16 leaves1. A complete answer states the conventional remainder and explains the relevant cycle or divisibility condition, not just an unexplained numeral.

Multiplication of remainders

Number-pattern question. a leaves2 mod5 and b leaves4; what does ab leave?

Worked result. 2×4=8, remainder3 mod5.

Why this remainder rule applies. Product of omitted full multiples remains divisible by5. The full multiples of the divisor do not affect the final remainder, but the divisor and domain must remain the same throughout.

First misconception. Multiplying quotient values is unnecessary.

Independent check. 7×9=63 leaves3 mod5. A complete answer states the conventional remainder and explains the relevant cycle or divisibility condition, not just an unexplained numeral.

Difference of remainders

Number-pattern question. a leaves1 mod7, b leaves5 mod7; what does a−b leave?

Worked result. 1−5=−4, equivalent to remainder3 mod7.

Why this remainder rule applies. Add one full cycle seven to get a nonnegative remainder. The full multiples of the divisor do not affect the final remainder, but the divisor and domain must remain the same throughout.

First misconception. Reporting −4 as standard nonnegative remainder is not conventional.

Independent check. a=8,b=5 gives difference3. A complete answer states the conventional remainder and explains the relevant cycle or divisibility condition, not just an unexplained numeral.

Even number remainder

Number-pattern question. What are possible remainders when dividing any integer by2?

Worked result. Zero or one.

Why this remainder rule applies. Even numbers give0, odd give1. The full multiples of the divisor do not affect the final remainder, but the divisor and domain must remain the same throughout.

First misconception. A remainder2 is another full pair.

Independent check. 17 leaves1. A complete answer states the conventional remainder and explains the relevant cycle or divisibility condition, not just an unexplained numeral.

Three consecutive integers

Number-pattern question. What remainders do three consecutive integers have modulo3?

Worked result. In some order0,1,2 exactly once each.

Why this remainder rule applies. Advancing one changes remainder by one and wraps after three. The full multiples of the divisor do not affect the final remainder, but the divisor and domain must remain the same throughout.

First misconception. They cannot all have same remainder.

Independent check. For 7,8,9 the remainders are1,2,0. A complete answer states the conventional remainder and explains the relevant cycle or divisibility condition, not just an unexplained numeral.

Four consecutive integers mod4

Number-pattern question. Find possible residues of n,n+1,n+2,n+3 modulo4.

Worked result. They are0,1,2,3 in some cyclic order.

Why this remainder rule applies. Four consecutive integers cover each residue once. The full multiples of the divisor do not affect the final remainder, but the divisor and domain must remain the same throughout.

First misconception. Two numbers cannot share same residue within four consecutive numbers.

Independent check. Use 10,11,12,13 residues2,3,0,1. A complete answer states the conventional remainder and explains the relevant cycle or divisibility condition, not just an unexplained numeral.

Weekday after one hundred

Number-pattern question. Start Thursday. What weekday100 days later?

Worked result. 100=14×7+2, so two days after Thursday is Saturday.

Why this remainder rule applies. Full seven-day blocks leave weekday unchanged. The full multiples of the divisor do not affect the final remainder, but the divisor and domain must remain the same throughout.

First misconception. Treating100 as a 100-week shift is wrong.

Independent check. After98 days it would be Thursday. A complete answer states the conventional remainder and explains the relevant cycle or divisibility condition, not just an unexplained numeral.

Weekday after twenty

Number-pattern question. Start Monday. What weekday20 days later?

Worked result. 20=2×7+6, six days after Monday is Sunday.

Why this remainder rule applies. Remainder6 determines shift. The full multiples of the divisor do not affect the final remainder, but the divisor and domain must remain the same throughout.

First misconception. Three days after Monday is Thursday, not Sunday.

Independent check. After21 days Monday returns. A complete answer states the conventional remainder and explains the relevant cycle or divisibility condition, not just an unexplained numeral.

Weekday before ten

Number-pattern question. Start Friday. What weekday ten days earlier?

Worked result. Ten days earlier is three days earlier modulo seven, so Tuesday.

Why this remainder rule applies. Ten=7+3; move three weekday steps backward. The full multiples of the divisor do not affect the final remainder, but the divisor and domain must remain the same throughout.

First misconception. Using three steps forward would be Monday.

Independent check. Tuesday to Friday is three forward days. A complete answer states the conventional remainder and explains the relevant cycle or divisibility condition, not just an unexplained numeral.

One day before a seven-week cycle

Number-pattern question. If a schedule repeats weekly, what day is49 days after Tuesday?

Worked result. Tuesday.

Why this remainder rule applies. 49 is exactly seven full weeks. The full multiples of the divisor do not affect the final remainder, but the divisor and domain must remain the same throughout.

First misconception. An answer Wednesday adds an unnecessary remainder1.

Independent check. 49/7=7 remainder0. A complete answer states the conventional remainder and explains the relevant cycle or divisibility condition, not just an unexplained numeral.

Twelve-hour dial

Number-pattern question. Clock dial points to9; five hours later which label?

Worked result. 9+5=14, modulo12 gives2, so label2.

Why this remainder rule applies. After dial12 it wraps to1. The full multiples of the divisor do not affect the final remainder, but the divisor and domain must remain the same throughout.

First misconception. A label14 is not printed on a 12-hour dial.

Independent check. From2, ten hours returns12. A complete answer states the conventional remainder and explains the relevant cycle or divisibility condition, not just an unexplained numeral.

Clock mark twelve

Number-pattern question. Clock dial is on mark12; 24 hours later?

Worked result. It is still mark12.

Why this remainder rule applies. 24=2 full cycles of12. The full multiples of the divisor do not affect the final remainder, but the divisor and domain must remain the same throughout.

First misconception. Standard remainder zero is displayed as mark12.

Independent check. A twelve-hour shift also returns12. A complete answer states the conventional remainder and explains the relevant cycle or divisibility condition, not just an unexplained numeral.

Twenty-four-hour time shift

Number-pattern question. A fictional 24-hour-cycle hour mark starts20; add9 whole hours.

Worked result. 20+9=29, remainder5 modulo24, so hour mark05.

Why this remainder rule applies. 24-hour labels repeat after midnight. The full multiples of the divisor do not affect the final remainder, but the divisor and domain must remain the same throughout.

First misconception. Do not confuse elapsed9 hours with a weekday shift.

Independent check. 29−24=5. A complete answer states the conventional remainder and explains the relevant cycle or divisibility condition, not just an unexplained numeral.

Last digit of a whole number

Number-pattern question. Find last digit of 12,347.

Worked result. Seven, the remainder modulo ten.

Why this remainder rule applies. Base-ten place value separates multiples of ten. The full multiples of the divisor do not affect the final remainder, but the divisor and domain must remain the same throughout.

First misconception. The first digit1 is not the last digit.

Independent check. 12,347=10×1234+7. A complete answer states the conventional remainder and explains the relevant cycle or divisibility condition, not just an unexplained numeral.

Last digit of product

Number-pattern question. Find last digit of103×97.

Worked result. 3×7=21 ends1, so product ends1.

Why this remainder rule applies. Only residues modulo ten affect final digit. The full multiples of the divisor do not affect the final remainder, but the divisor and domain must remain the same throughout.

First misconception. Multiplying leading digits is irrelevant to last digit.

Independent check. 103×97=9,991. A complete answer states the conventional remainder and explains the relevant cycle or divisibility condition, not just an unexplained numeral.

Last digit of a sum

Number-pattern question. Find final digit of398+765.

Worked result. 8+5=13, last digit3.

Why this remainder rule applies. The other place values contribute multiples of ten. The full multiples of the divisor do not affect the final remainder, but the divisor and domain must remain the same throughout.

First misconception. The sum’s last digit is not13.

Independent check. 398+765=1163. A complete answer states the conventional remainder and explains the relevant cycle or divisibility condition, not just an unexplained numeral.

Power of two cycle

Number-pattern question. List final digits of2¹ through2⁶.

Worked result. 2,4,8,6,2,4.

Why this remainder rule applies. Multiplying by two repeats final digits every four powers. The full multiples of the divisor do not affect the final remainder, but the divisor and domain must remain the same throughout.

First misconception. Assuming last digits grow indefinitely ignores modulo ten.

Independent check. 2⁵ ends2. A complete answer states the conventional remainder and explains the relevant cycle or divisibility condition, not just an unexplained numeral.

Last digit of2²⁵

Number-pattern question. Find last digit of2²⁵.

Worked result. 25 mod4=1, so cycle position1 gives digit2.

Why this remainder rule applies. Power-cycle length is four. The full multiples of the divisor do not affect the final remainder, but the divisor and domain must remain the same throughout.

First misconception. Using exponent25 directly as a digit makes no sense.

Independent check. 2²¹ would also end2. A complete answer states the conventional remainder and explains the relevant cycle or divisibility condition, not just an unexplained numeral.

Last digit of2²⁶

Number-pattern question. Find last digit of2²⁶.

Worked result. 26 mod4=2, cycle second digit4.

Why this remainder rule applies. Modulo exponent by cycle length identifies position. The full multiples of the divisor do not affect the final remainder, but the divisor and domain must remain the same throughout.

First misconception. Dividing exponent by ten is not the relevant pattern here.

Independent check. 2²² also ends4. A complete answer states the conventional remainder and explains the relevant cycle or divisibility condition, not just an unexplained numeral.

Power of three cycle

Number-pattern question. List final digits of3¹ through3⁵.

Worked result. 3,9,7,1,3.

Why this remainder rule applies. The units digit repeats every four powers. The full multiples of the divisor do not affect the final remainder, but the divisor and domain must remain the same throughout.

First misconception. Assuming a three-step cycle fails at power4.

Independent check. 3⁴=81 ends1. A complete answer states the conventional remainder and explains the relevant cycle or divisibility condition, not just an unexplained numeral.

Last digit of3²²

Number-pattern question. Find last digit of3²².

Worked result. 22 mod4=2, so digit9.

Why this remainder rule applies. Power-of-three cycle position2 is nine. The full multiples of the divisor do not affect the final remainder, but the divisor and domain must remain the same throughout.

First misconception. Exponent22 is not the base’s remainder mod10.

Independent check. 3² ends9 as check. A complete answer states the conventional remainder and explains the relevant cycle or divisibility condition, not just an unexplained numeral.

Power of seven cycle

Number-pattern question. List final digits of7¹ through7⁵.

Worked result. 7,9,3,1,7.

Why this remainder rule applies. The cycle length is four. The full multiples of the divisor do not affect the final remainder, but the divisor and domain must remain the same throughout.

First misconception. Assuming all odd powers end7 is wrong.

Independent check. 7⁴=2401 ends1. A complete answer states the conventional remainder and explains the relevant cycle or divisibility condition, not just an unexplained numeral.

Last digit of7¹¹

Number-pattern question. Find last digit of7¹¹.

Worked result. 11 mod4=3, cycle position3 gives3.

Why this remainder rule applies. The third power’s final digit is3. The full multiples of the divisor do not affect the final remainder, but the divisor and domain must remain the same throughout.

First misconception. An exponent remainder0 would correspond fourth position1.

Independent check. 7³=343 ends3. A complete answer states the conventional remainder and explains the relevant cycle or divisibility condition, not just an unexplained numeral.

Power of nine cycle

Number-pattern question. What final digit does9²⁰⁰ have?

Worked result. One, because powers of nine alternate9,1 and exponent200 is even.

Why this remainder rule applies. A two-step last-digit cycle. The full multiples of the divisor do not affect the final remainder, but the divisor and domain must remain the same throughout.

First misconception. Assuming9 always ends9 ignores square81.

Independent check. 9² ends1. A complete answer states the conventional remainder and explains the relevant cycle or divisibility condition, not just an unexplained numeral.

Power of five

Number-pattern question. What last digit does5¹⁰⁰ have?

Worked result. Five.

Why this remainder rule applies. Every positive power of five ends in5. The full multiples of the divisor do not affect the final remainder, but the divisor and domain must remain the same throughout.

First misconception. The exponent need not be reduced further here.

Independent check. 5²=25,5³=125 both end5. A complete answer states the conventional remainder and explains the relevant cycle or divisibility condition, not just an unexplained numeral.

Divisibility by three

Number-pattern question. Is 123 divisible by3?

Worked result. Digit sum1+2+3=6, divisible by3, so yes.

Why this remainder rule applies. Powers of ten leave remainder1 mod3. The full multiples of the divisor do not affect the final remainder, but the divisor and domain must remain the same throughout.

First misconception. Checking last digit alone cannot test divisibility by3.

Independent check. 123/3=41. A complete answer states the conventional remainder and explains the relevant cycle or divisibility condition, not just an unexplained numeral.

Divisibility by nine

Number-pattern question. Is 729 divisible by9?

Worked result. Digit sum7+2+9=18, so yes.

Why this remainder rule applies. Digit sum and original share remainder mod9. The full multiples of the divisor do not affect the final remainder, but the divisor and domain must remain the same throughout.

First misconception. The ending9 alone does not always imply divisible by9.

Independent check. 729/9=81. A complete answer states the conventional remainder and explains the relevant cycle or divisibility condition, not just an unexplained numeral.

Non-divisible digit sum

Number-pattern question. Is 725 divisible by3?

Worked result. Digit sum7+2+5=14, remainder2 mod3, so no.

Why this remainder rule applies. The digit-sum test records correct residue. The full multiples of the divisor do not affect the final remainder, but the divisor and domain must remain the same throughout.

First misconception. Last digit5 only informs divisibility by5 and ten.

Independent check. 725=3×241+2. A complete answer states the conventional remainder and explains the relevant cycle or divisibility condition, not just an unexplained numeral.

Divisibility by eleven

Number-pattern question. Is1001 divisible by11?

Worked result. Alternating digit sum1−0+0−1=0, so yes.

Why this remainder rule applies. Ten is −1 modulo11, producing alternating signs. The full multiples of the divisor do not affect the final remainder, but the divisor and domain must remain the same throughout.

First misconception. Divisible by11 does not mean divisible by two.

Independent check. 1001=11×91. A complete answer states the conventional remainder and explains the relevant cycle or divisibility condition, not just an unexplained numeral.

Number remainder two mod five

Number-pattern question. Describe all nonnegative integers leaving remainder2 on division by5.

Worked result. n=5k+2 for whole k≥0, giving2,7,12,17,… .

Why this remainder rule applies. Any full groups of five leave the same two extras. The full multiples of the divisor do not affect the final remainder, but the divisor and domain must remain the same throughout.

First misconception. A single example7 is not the complete solution set.

Independent check. Each candidate divided by5 leaves2. A complete answer states the conventional remainder and explains the relevant cycle or divisibility condition, not just an unexplained numeral.

Remainder with upper bound

Number-pattern question. Find whole n<20 leaving remainder2 mod5.

Worked result. 2,7,12,17.

Why this remainder rule applies. Restrict sequence5k+2 to allowed range. The full multiples of the divisor do not affect the final remainder, but the divisor and domain must remain the same throughout.

First misconception. 22 has right remainder but violates upper bound.

Independent check. All four are below20. A complete answer states the conventional remainder and explains the relevant cycle or divisibility condition, not just an unexplained numeral.

Add divisibility condition

Number-pattern question. Find whole n<20, n≡2 mod5 and n divisible by3.

Worked result. Only n=12.

Why this remainder rule applies. Among2,7,12,17 only12 is multiple3. The full multiples of the divisor do not affect the final remainder, but the divisor and domain must remain the same throughout.

First misconception. Both conditions must hold.

Independent check. 12=5×2+2 and12=3×4. A complete answer states the conventional remainder and explains the relevant cycle or divisibility condition, not just an unexplained numeral.

Two remainders combined

Number-pattern question. Find smallest positive n with n≡1 mod3 and n≡2 mod5.

Worked result. n=7, since7 leaves1 mod3 and2 mod5.

Why this remainder rule applies. Test candidates2,7,12,… for the second condition or construct systematically. The full multiples of the divisor do not affect the final remainder, but the divisor and domain must remain the same throughout.

First misconception. n=2 leaves2 mod3, not1.

Independent check. 7 is the first qualifying positive integer. A complete answer states the conventional remainder and explains the relevant cycle or divisibility condition, not just an unexplained numeral.

Another two-condition puzzle

Number-pattern question. Find smallest positive n≡2 mod3 and n≡1 mod4.

Worked result. n=5, because5 mod3=2 and5 mod4=1.

Why this remainder rule applies. Intersection of two residue sets determines candidate. The full multiples of the divisor do not affect the final remainder, but the divisor and domain must remain the same throughout.

First misconception. n=2 fails second condition.

Independent check. Next matching value would be17. A complete answer states the conventional remainder and explains the relevant cycle or divisibility condition, not just an unexplained numeral.

Divisibility by six

Number-pattern question. Is84 divisible by6?

Worked result. Yes; 84 is even and digit sum12 divisible by3.

Why this remainder rule applies. Divisibility by both two and three implies by their product six. The full multiples of the divisor do not affect the final remainder, but the divisor and domain must remain the same throughout.

First misconception. Being even alone does not guarantee divisible6.

Independent check. 84/6=14. A complete answer states the conventional remainder and explains the relevant cycle or divisibility condition, not just an unexplained numeral.

Remainder after doubling

Number-pattern question. If n leaves remainder3 mod7, what does2n leave?

Worked result. 6 mod7.

Why this remainder rule applies. Multiplying by two multiplies residue, then reduces. The full multiples of the divisor do not affect the final remainder, but the divisor and domain must remain the same throughout.

First misconception. A remainder6 is valid because it is less than7.

Independent check. Choose n=10; 20 leaves6 mod7. A complete answer states the conventional remainder and explains the relevant cycle or divisibility condition, not just an unexplained numeral.

Remainder after squaring

Number-pattern question. If n leaves remainder4 mod5, what does n² leave?

Worked result. 4²=16, remainder1 mod5.

Why this remainder rule applies. Full multiples of five vanish under multiplication. The full multiples of the divisor do not affect the final remainder, but the divisor and domain must remain the same throughout.

First misconception. Using remainder16 without reducing is incomplete.

Independent check. n=9 gives81 remainder1. A complete answer states the conventional remainder and explains the relevant cycle or divisibility condition, not just an unexplained numeral.

Remainder after subtraction

Number-pattern question. If a leaves1 and b leaves4 modulo6, what does a−b leave?

Worked result. 1−4=−3, equivalent to3 modulo6.

Why this remainder rule applies. Adding the modulus6 gives valid nonnegative remainder. The full multiples of the divisor do not affect the final remainder, but the divisor and domain must remain the same throughout.

First misconception. Negative three is a congruent representative, not standard remainder.

Independent check. a=7,b=4 gives3. A complete answer states the conventional remainder and explains the relevant cycle or divisibility condition, not just an unexplained numeral.

Parity of squared integer

Number-pattern question. What are possible remainders of n² mod4?

Worked result. Zero if n even, or one if n odd.

Why this remainder rule applies. Even squared multiple4; odd squared leaves1 mod4. The full multiples of the divisor do not affect the final remainder, but the divisor and domain must remain the same throughout.

First misconception. Remainders2 or3 cannot arise from perfect squares.

Independent check. 3²=9 remainder1; 4²=16 remainder0. A complete answer states the conventional remainder and explains the relevant cycle or divisibility condition, not just an unexplained numeral.

Square never remainder two mod three

Number-pattern question. Show n² cannot leave remainder2 on division by3.

Worked result. n residues0,1,2; squares reduce0,1,1 respectively.

Why this remainder rule applies. Check all three remainder classes, not a few integers. The full multiples of the divisor do not affect the final remainder, but the divisor and domain must remain the same throughout.

First misconception. Assuming every positive n has different square residue is wrong.

Independent check. If n²≡2 mod3, no integer n exists. A complete answer states the conventional remainder and explains the relevant cycle or divisibility condition, not just an unexplained numeral.

One-digit parity pattern

Number-pattern question. What is the remainder of an odd integer after division by2?

Worked result. One.

Why this remainder rule applies. Odd means2k+1 for integer k. The full multiples of the divisor do not affect the final remainder, but the divisor and domain must remain the same throughout.

First misconception. A remainder of −1 is not standard nonnegative form, though congruent.

Independent check. Any two odd numbers sum to even. A complete answer states the conventional remainder and explains the relevant cycle or divisibility condition, not just an unexplained numeral.

Calendar problem missing origin

Number-pattern question. Can the weekday100 days later be named if starting weekday is unknown?

Worked result. Only the offset of two weekdays can be stated, not a particular day name.

Why this remainder rule applies. A cycle length and elapsed time do not supply the starting state. The full multiples of the divisor do not affect the final remainder, but the divisor and domain must remain the same throughout.

First misconception. Guessing Saturday without Thursday start is unsupported.

Independent check. Specify starting day to finish the calendar claim. A complete answer states the conventional remainder and explains the relevant cycle or divisibility condition, not just an unexplained numeral.

An unsupplied cycle

Number-pattern question. A machine repeats a secret pattern. Can its result after100 steps be inferred from one observed step?

Worked result. No. The cycle length and pattern must be given or inferred with enough evidence.

Why this remainder rule applies. Modular reduction requires a known valid repeat structure. The full multiples of the divisor do not affect the final remainder, but the divisor and domain must remain the same throughout.

First misconception. Assuming length seven because weeks have seven days is unrelated.

Independent check. Ask for one full confirmed cycle first. A complete answer states the conventional remainder and explains the relevant cycle or divisibility condition, not just an unexplained numeral.

A large number ending zero

Number-pattern question. What is 10,000 modulo ten?

Worked result. Zero.

Why this remainder rule applies. An exact multiple of ten has no leftover units. The full multiples of the divisor do not affect the final remainder, but the divisor and domain must remain the same throughout.

First misconception. Remainder ten is another full group.

Independent check. The number ends with digit0. A complete answer states the conventional remainder and explains the relevant cycle or divisibility condition, not just an unexplained numeral.

A final combined pattern

Number-pattern question. Find last digit of 2²⁵+3²².

Worked result. 2²⁵ ends2; 3²² ends9; sum last digit1.

Why this remainder rule applies. Remainders add modulo ten after each power-cycle reduction. The full multiples of the divisor do not affect the final remainder, but the divisor and domain must remain the same throughout.

First misconception. Computing enormous complete powers is unnecessary.

Independent check. 2+9=11, remainder1 mod10. A complete answer states the conventional remainder and explains the relevant cycle or divisibility condition, not just an unexplained numeral.

A twenty-minute workshop that connects grouping, weekdays and powers

Give three pupils the number 29 and divisor five. One draws five-sized groups and counts the four extras; another writes 29=5×5+4; the third lists 4,9,14,19,24,29 and explains why the same remainder appears. They should recognise that adding five preserves remainder four, without relying on a particular number of physical counters.

Change the modulus from five to seven and use a weekday shift of 100 days. A student calculates100=14×7+2, another counts two days forward from Thursday, and the third checks the result by starting with 98 days, which is exactly fourteen weeks. Finally give powers of two and ask pupils to discover the four-step final-digit pattern from small exact powers before using it on 2²⁵.

A two-week plan from ordinary division to repeating patterns

Week one: Practise quotient-remainder equations and small integer divisibility. Every remainder must be less than its positive divisor. Use tiles and number lines when a child has difficulty seeing why extra full groups change the quotient rather than the remainder. Connect the principle to parity and digit endings.

Week two: Explore a known seven-day cycle, a twelve-hour dial and repeating last digits of powers. Keep the formal notation optional. Add simple two-condition search problems such as ‘less than 20, leaves two mod five, and is divisible by three’. End with one underdetermined story where the starting weekday or cycle length is deliberately missing, and ask the learner to identify what information is needed.

Frequently asked: is modular arithmetic part of every Secondary 2 G3 exam?

No. This article uses the language of modular arithmetic as an optional way to explain remainders and patterns, not as a claim that formal congruence notation is a compulsory immediate Secondary 2 chapter. Whole-number divisibility and reasoning remain useful prerequisites. Follow the student’s own school assessment notices for the tested scope.

Frequently asked: can a remainder equal the divisor?

Not in conventional division by a positive integer. If the remainder were equal to the divisor, another complete group could be removed, leaving remainder zero. The allowed remainder values are zero through one less than the divisor.

Frequently asked: how can a very large exponent have an easy last digit?

Only the repeating sequence of final digits matters. The powers of two follow 2,4,8,6 and repeat every four powers. Reduce the exponent to its cycle position and read the matching digit. Always verify the cycle before using it; a different base may have a different pattern.

Frequently asked: why does the sum of digits test divisibility by three?

Because ten is one more than a multiple of three. Every power of ten also has remainder one modulo three, so the number and its decimal digit sum have the same remainder. Divisibility by nine works analogously. This explanation is more durable than treating digit-sum tests as unexplained tricks.

Frequently asked: what if the story has no solution?

Two remainder conditions can contradict each other. For instance, an even integer cannot also leave remainder one when divided by two. Write both conditions and check whether any permitted integer can satisfy them. A correct ‘no solution’ result is better than guessing a convenient number that meets only one restriction.

Frequently asked: are clock calculations the same as real calendar information?

They share a repeating-cycle principle, but actual dates require a valid starting day, calendar conventions and, for a live local clock, a current time source. This guide solves fictional cycles with stated origins; it does not infer today’s date or a future public holiday from an unknown beginning.

Teaching benchmark, official Mathematics and companion explanations

The unchanged eduKateSG small-group Mathematics reference describes three-pupil weekly tutorials lasting 1.5 hours, with guided corrections at 8 Fourth Avenue, Singapore 268674 near Sixth Avenue MRT. This Bukit Timah guide serves nearby families and does not assert another classroom or available slot.

G3 is a subject level under Full Subject-Based Banding. The SEAB 2027 G3 syllabus index and Mathematics K310 syllabus explain the broader emphasis on number sense, mathematical reasoning and communication. Formal modular notation and some residue proofs are presented here as enrichment, not as an asserted immediate examination requirement.

Related foundations are HCF and LCM in repeating schedules, number patterns and algebraic sequences, and divisibility proofs. This article focuses on the leftover quantity and cyclic equivalence rather than repeating common-factor methods.

Parents can use the original teaching reference to enquire about a suitable Secondary 2 G3 Mathematics tutorial. Bring one marked number-pattern problem and the school assessment notice, then confirm current group fit, schedule and vacancies with the centre.

Editorial review: 5 November 2026. All calendar starting days, cycles and machines are hypothetical classroom situations. Formal congruence and advanced power-pattern examples are optional extensions beyond some Secondary 2 courses.