A remainder tells us what is left after complete equal groups have been removed. In a repeating pattern, it tells us where we are after complete cycles have passed. These are two views of the same idea: separate the completed repetitions from the position still to be accounted for.
A pattern repeats red, blue, green, yellow. To find the nineteenth colour, separate nineteen positions into four complete cycles of four and three more positions. The third colour is green. To find the twentieth, the division has remainder zero: it is the last colour of a completed cycle, yellow, not a nonexistent “zeroth colour.”
This guide develops repeated patterns, circular moves, clock faces, weekdays, recurring events and small remainder constraints. It is Primary Mathematics enrichment with a bridge to the later notation of modular arithmetic. The existing Factors, Multiples and Divisibility and Equal Groups, Division and Remainders guides remain the prerequisites; this article concentrates on cycles and positions rather than repeating their full arithmetic coverage.
Formal congruence notation and cancellation examples are optional extensions, not a statement that every Primary learner must study them. Use the MOE Primary curriculum page and the learner’s school programme to establish required scope. NRICH’s Clock Arithmetic offers related extension work; the examples and practice below are independently constructed.
Division and remainders · Pattern positions · Circular movement · Clock and calendar · Repeating events · Modular arithmetic · 24 questions · Worked answers · Teaching
1. A valid remainder is smaller than the group size
For a non-negative whole number N and a positive whole-number group size m, division gives a whole-number quotient q and a remainder r satisfying N = m × q + r, with 0 ≤ r < m. The quotient counts complete groups; the remainder counts the amount that cannot form another complete group.
For fifty-three divided by seven, seven complete groups account for forty-nine and four remain. The statement is 53 = 7 × 7 + 4. Both the reconstruction and the remainder-size condition matter. Writing six groups with eleven left also reconstructs fifty-three, but it is not completed division because eleven contains another group of seven.
Remainder zero is meaningful
Eighty divided by eight gives ten complete groups and remainder zero. Nothing is unaccounted for. Zero is not a missing answer or evidence that the calculation failed. It says the quantity lands exactly at a group boundary.
When the problem is about physical leftovers, zero means none are left. When it is about a position in a pattern numbered from one, zero may indicate the final position of a complete cycle. Interpret the mathematical result through the indexing convention used by the question.
Know the possible remainder values
When dividing by six, the only possible remainders are zero, one, two, three, four and five. A remainder of six is too large because it makes one more full group. A negative leftover is not a standard remainder for the non-negative division model used here.
This small range is useful. Any whole-number collection divided by six must belong to one of six remainder categories. The original collection might be enormous, but its position relative to groups of six has only six possibilities.
Same remainder does not mean same number
Twenty-seven and forty-three both leave remainder three when divided by eight. They are not equal quantities. Their difference, sixteen, is two complete groups of eight. They occupy the same relative position within an eight-step cycle because the extra sixteen changes only the number of complete cycles.
Ask the learner to state what has been retained and what has been discarded. A remainder retains cycle position but not the completed-group count. Knowing only remainder three cannot recover whether the original number was three, eleven, nineteen or another member of the same class.
2. A pattern position is not automatically a movement count
Write a repeating block red, blue, green, yellow and number its first occurrence one, two, three, four. Position one is red. Position five is red again. Every complete set of four positions returns the same colour order.
To find position nineteen, calculate 19 = 4 × 4 + 3. Four full blocks cover sixteen positions; the next three positions are red, blue, green. To find position twenty, 20 = 4 × 5 + 0 identifies the end of the fifth full block, yellow.
A reliable one-based position rule
For a cycle of length m whose entries are numbered one through m, subtract one from the requested position, find the remainder after division by m, and then add one. This produces a cycle index from one to m without a special “remainder zero” exception.
For position twenty in a four-item cycle, nineteen leaves remainder three; add one to obtain index four. For position one, zero leaves remainder zero; add one to obtain index one. The same rule handles the beginning and exact cycle boundaries.
The simpler verbal method also works: a non-zero remainder selects that numbered item, while remainder zero selects the last item. Choose the version the learner can explain. Do not memorise both without connecting them to the same numbered pattern.
Example A: A large position
The four-symbol block triangle, circle, circle, square repeats. Position 2,026 leaves remainder two on division by four, so it is a circle. The two circle entries are separate positions even though their symbols match.
A repeated symbol does not automatically shorten the block. The sequence triangle, circle, circle, square is not a two-symbol repeating sequence. To propose a shorter cycle, verify that the entire infinite continuation would repeat after that shorter step, not just that two adjacent entries look the same.
Example B: A three-item cycle
The block A, B, A repeats. The fiftieth position gives remainder two on division by three, so it is B. Positions one and three both show A, but their next symbols differ: A at position one is followed by B, whereas A at position three is followed by A at the start of the next block.
That difference explains why the visible label alone may not identify the full state of a repeating process. Position within the cycle can contain information that the symbol itself does not reveal.
Check a rule at the start, boundary and next position
Before using a formula for a distant term, test positions one, m and m + 1. They should select the first entry, the last entry and the first entry again. These three tests catch many off-by-one errors that remain hidden when only a middle position is checked.
This is a small verification task, not proof that every guessed formula works. The general reason remains the decomposition into complete blocks and a residual position. Testing makes that reason easier to inspect.
3. Circular movement starts with a location and then counts moves
Consider eight locations labelled zero through seven in a ring. Start at zero and make nineteen one-step clockwise moves. Sixteen moves complete two circuits, and three more reach location three. Here remainder zero would mean returning to location zero, because the question counts moves from an explicitly labelled starting position.
This differs from the twentieth entry of a one-based colour pattern. The mathematics is consistent; the records use different starting conventions. A position number counts the first displayed item as one, while a movement count begins at zero moves before any action.
Example C: A non-zero start
Start at location six on the same eight-location ring and move fifteen steps clockwise. The combined location count is six plus fifteen, or twenty-one. Removing two full circuits of eight leaves location five. A step-by-step check passes seven, zero, one and so on until it ends at five.
Do not reduce the movement to remainder seven and then report seven as the final location. Seven is the residual movement, not the endpoint. It must still be applied to the starting location six.
Example D: Moving backwards
Start at location two and move five steps anticlockwise. The successive positions are one, zero, seven, six and five, so the endpoint is five. A symbolic calculation gives 2 − 5 = −3; adding one full circuit of eight gives the equivalent ring location five.
The negative intermediate arithmetic is optional enrichment. A learner can trace the five backward moves directly. What matters is that crossing zero wraps to seven rather than leaving the ring.
Example E: Larger jumps can miss some locations
On a ten-location ring labelled zero to nine, start at zero and repeatedly move four steps clockwise. The visited positions are zero, four, eight, two, six, then zero again. Five moves return to the start, and only even-labelled positions are visited.
The presence of ten ring locations does not force a ten-move cycle. The step size and ring size interact. To justify the five-move return, note that four, eight, twelve and sixteen total steps are not multiples of ten, while twenty steps is. Five is the first positive move count completing a whole number of circuits.
Equal-looking endpoints can hide different travel distances
Moving three steps and moving eleven steps on an eight-location ring reach the same endpoint from the same start. The second journey still includes eight additional steps. Remainder reasoning identifies location, not total distance travelled, elapsed time or number of circuits.
This distinction will matter in a clock question. Two events at the same hour-face label can be twelve hours apart, twenty-four hours apart or more. A repeating display intentionally omits some information.
4. Clock and weekday questions require units and a reference point
On a twelve-hour face, hour labels repeat after twelve hours. Start at the label ten and advance twenty-nine hours. Twenty-four hours complete two face circuits, leaving five more hours. Ten plus five reaches label three. If the start was 10 a.m., the full time is 3 p.m. the following day, not merely an unspecified three o’clock.
The full time statement needs both the cyclic label and the completed time information. A face label alone cannot identify morning, afternoon or date. Preserve those additional quantities when the question asks for them.
Minutes and hours are different cycles
Starting at 11:45 and adding fifty minutes gives 12:35. The minute total forty-five plus fifty is ninety-five: one complete group of sixty minutes and thirty-five minutes. The extra hour changes eleven to twelve. Treating 11:45 as the decimal 11.45 would use the wrong place-value system.
A written record can separate hour count and minute count. Alternatively, move fifteen minutes to noon and then thirty-five more. Both routes preserve the same fifty-minute duration and should reach the same result.
Weekdays repeat every seven days
Suppose a reference day is Tuesday. One hundred days later, divide one hundred by seven: fourteen complete weeks account for ninety-eight days, leaving two. Two days after Tuesday is Thursday. The word “later” counts Tuesday as zero elapsed days.
If instead a list calls Tuesday “Day 1” and asks for “Day 100,” there are ninety-nine elapsed days from Day 1 to Day 100. Ninety-nine leaves remainder one, giving Wednesday. These questions differ by one because their numbering conventions differ, not because the weekday cycle is uncertain.
Example F: Backward weekday reasoning
A reference day is Friday. What weekday was it sixteen days earlier? Fourteen days is two complete weeks, leaving two days to move backwards. Two days before Friday is Wednesday. This is a hypothetical weekday calculation, not a claim about today’s actual date.
When actual calendar dates are involved, month lengths and leap-year rules may matter. This guide does not infer a future date from a weekday label alone. The repeated seven-day structure answers only the weekday part unless the full calendar information is supplied.
Mark the event numbered zero
For routines, write “start,” “after one day,” “after two days” before calculating a distant point. For repeated lessons, distinguish the first lesson from the first completed interval. An activity held every three days beginning on Day 2 occurs on Days 2, 5, 8 and so on. Its tenth occurrence is Day 29 because only nine three-day intervals separate the first and tenth occurrences.
This is another form of the position-versus-movement distinction. A clear reference point prevents an otherwise correct multiplication from being attached one interval too far ahead.
5. Repeating events meet when both schedules agree
Two lights flash together at time zero. One flashes every six seconds and the other every eight. Their future flash times are positive multiples of six and eight. The first shared positive time is twenty-four seconds. This is the least common multiple of the two intervals.
The same calculation can be checked by listing: six, twelve, eighteen, twenty-four for the first light; eight, sixteen, twenty-four for the second. The zero starting coincidence is not the answer when the question asks when they next coincide.
Starting offsets change the question
Suppose one activity occurs on Day 3 and every five days afterwards, while another occurs on Day 1 and every three days afterwards. The first list is 3, 8, 13, 18, 23 and so on. The second is 1, 4, 7, 10, 13 and so on. Their first shared day is thirteen.
The least common multiple of five and three is fifteen, but fifteen is not the first shared day here. The activities did not start together at zero. Once a common day thirteen has been found, adding fifteen gives another common day twenty-eight. The repeat gap and the first coincidence are different quantities.
Every candidate must satisfy both remainder conditions
A number leaving remainder two when divided by four has the form two plus a multiple of four. Requiring remainder one when divided by three imposes another condition. Within one to fifty, candidates are ten, twenty-two, thirty-four and forty-six.
Check ten: division by four leaves two and division by three leaves one. Add twelve, a common multiple of four and three, and both remainders are preserved. A bounded list establishes all candidates in the requested range; it does not license selecting just the first and claiming uniqueness.
Some remainder conditions cannot coincide
A number cannot be even and also leave remainder one on division by four, because every number of the form four groups plus one is odd. The absence of a solution follows from incompatible conditions, not from failing to search far enough.
Similarly, a clock schedule with limited operating hours needs those limits checked even after the repeating conditions match. A mathematical coincidence after closing time does not satisfy a problem requiring the event during the stated session.
Use the simplest adequate method
For small intervals and a short range, an organised list may be clearer than formal congruence equations. For large numbers, reducing full cycles can save substantial work. The method should expose the reason for the coincidence, not merely produce a number that looks like a common multiple.
The earlier Systematic Listing guide supplies a completeness framework: every listed candidate must be valid, duplicates must be removed and every possible candidate in the stated range must have a place in the search.
6. Modular notation records equal remainders, not ordinary equality
The notation 17 ≡ 5 (mod 12) says that seventeen and five leave the same remainder on division by twelve. Equivalently, their difference is a multiple of twelve. It does not say that seventeen equals five as an ordinary number. The extra complete twelve is being ignored only for the chosen cyclic comparison.
Formal notation is optional in this Primary enrichment route. “They land at the same position on a twelve-step cycle” is often enough. The symbol becomes useful when several remainder relationships must be written compactly.
Adding and multiplying preserve congruent replacements
When working modulo seven, nine has the same remainder as two. Thus six plus nine can be reduced as six plus two, or eight, which has remainder one. The full sum fifteen also leaves remainder one. Replacing nine by two removed one complete group of seven and did not change the remainder.
For multiplication, eleven has the same remainder as three modulo four. Seven times eleven has the same remainder as seven times three because the difference is seven times eight, a multiple of four. Both products have remainder one. The argument explains why reducing large factors can simplify a calculation.
Example G: A last-digit cycle
The powers of three have unit digits three, nine, seven, one, then three again. Multiplying by three sends each listed last digit to the next, so the four-step cycle continues. To find the unit digit of 3 to the power ten, divide the positive exponent ten by four. Remainder two selects the second entry, nine.
Check the cycle boundary carefully: exponent four corresponds to the fourth entry one, not a missing zeroth entry. Exponent zero gives 3⁰ = 1 and is handled separately from a list that began at exponent one. State where a power sequence starts before using its remainder rule.
Not every operation can be reversed from remainders alone
Suppose twice a and twice b have the same remainder modulo six. Must a and b have the same remainder modulo six? No. Choose a = 1 and b = 4. Their doubles two and eight both leave remainder two, but the original remainders one and four differ.
Dividing an ordinary equality by two is legitimate; cancelling a factor in a modular relation can require extra conditions. This example is included to prevent transferring a familiar rule without checking its setting. A learner need not study modular inverses to understand the counterexample.
Remainders are useful because they deliberately forget something
A remainder keeps position while dropping complete-group count. That compression makes a million-step cycle manageable, but it also creates limits. Many different originals have the same remainder. A single remainder clue cannot identify an unrestricted original number, and equal endpoints do not show equal journeys.
Connect this with Logic and Truth Conditions: a conclusion must not be stronger than its information. Remainder arithmetic is reliable when the modulus, allowed values, starting convention and requested quantity remain explicit.
7. Practice: 24 questions
Use non-negative whole-number division with a positive divisor. For rings, locations are numbered from zero as stated. For displayed repeating patterns, the first shown symbol is position one. The clock and weekday scenarios are hypothetical. Keep the worked answers covered until an attempt is complete.
Questions 1–8: Remainders and complete groups
1. Divide fifty-three by seven. Give quotient and remainder and reconstruct the original.
2. Divide eighty by eight. Explain the remainder.
3. A learner writes “34 divided by 5 is 5 remainder 9.” Explain why this is unfinished and correct it.
4. List all possible remainders on division by six.
5. Find the remainder when forty-six is divided by nine.
6. List every whole number from one to thirty inclusive that leaves remainder three on division by five.
7. Do twenty-seven and forty-three have the same remainder on division by eight? Explain through their difference as well as direct division.
8. Find the remainder of 6 + 9 on division by seven, first by adding and then by reducing complete groups.
Questions 9–16: Positions and circular moves
9. Red, blue, green, yellow repeats from position one. Find the nineteenth colour.
10. In the same pattern, find the twentieth colour and explain remainder zero.
11. Triangle, circle, circle, square repeats. Find the symbol at position 2,026.
12. A, B, A repeats. Find the fiftieth symbol.
13. On an eight-location ring labelled zero to seven, start at zero and move nineteen steps clockwise. Where do you finish?
14. On the same ring, start at six and move fifteen steps clockwise. Find the endpoint.
15. On the same ring, start at two and move five steps anticlockwise. Find the endpoint.
16. A hypothetical clock starts at 10 a.m. Advance twenty-nine hours. Give the hour-face label and the full morning/afternoon and day relationship.
Questions 17–24: Time, schedules and generalisation
17. A clock reads 11:45 a.m. Add fifty minutes. Give the new time.
18. A reference day is Tuesday. What weekday is one hundred days later? The reference day counts as zero elapsed days.
19. Two lights flash together at time zero and then every six and eight seconds respectively. When do they next flash together?
20. Activity A occurs on Day 3 and every five days afterwards. Activity B occurs on Day 1 and every three days afterwards. Find their first common day.
21. Use a unit-digit cycle to find the last digit of 3¹⁰.
22. List all whole numbers from one to fifty that leave remainder two on division by four and remainder one on division by three.
23. A learner claims that if 2a and 2b have the same remainder modulo six, then a and b must also. Test the claim with a = 1 and b = 4.
24. On a ten-location ring, start at zero and repeatedly move four steps clockwise. How many moves first return to zero? List the visited endpoints and explain why not every location is reached.
8. Worked answers and boundary checks
Answers 1–8
1. Quotient 7, remainder 4. Seven complete groups of seven account for forty-nine, leaving four. The reconstruction is 53 = 7 × 7 + 4. Four is smaller than seven, so another complete group cannot be formed. Both requirements of a completed division are satisfied.
2. Quotient 10, remainder 0. Ten groups of eight account for all eighty. Zero means no amount is left outside the complete groups. It is a valid remainder, not a blank answer, and shows that eighty lies exactly on an eight-item group boundary.
3. Quotient 6, remainder 4. The proposed five groups and nine leftovers total thirty-four, but nine contains another complete group of five. Transfer five from the leftovers into a sixth group, leaving four. Reconstructing the total alone is insufficient unless the remainder is also smaller than the divisor.
4. 0, 1, 2, 3, 4, 5. Any leftover of six or more would contain another complete group of six. Negative leftovers are excluded in the standard remainder convention used here. These six possibilities classify every non-negative whole number by its remainder on division by six.
5. 1. Five groups of nine make forty-five and one remains: 46 = 9 × 5 + 1. Checking the nearby multiple gives the remainder directly. The quotient five and remainder one have different jobs and should not be exchanged.
6. 3, 8, 13, 18, 23, 28. Begin at three and repeatedly add five, which changes only the number of complete groups. The next value thirty-three exceeds the upper limit. Every required number has the form 5q + 3, so the list is complete in the stated range.
7. Yes; remainder 3. Twenty-seven is three groups of eight plus three, and forty-three is five groups plus three. Their difference sixteen is two full groups of eight. This explains why the remainders agree without implying that the original numbers are equal.
8. 1. Adding gives fifteen, which is two sevens plus one. Alternatively, nine can be replaced by its remainder two for this calculation: six plus two is eight, another full seven plus one. Both approaches preserve the requested remainder.
Answers 9–16
9. Green. Nineteen equals four complete four-position blocks plus three positions. The third entry in the block is green. The count begins with red as position one, so this is a one-based pattern-position problem rather than movement from a location labelled zero.
10. Yellow. Twenty positions complete five full blocks. Remainder zero identifies the end of the fifth block, whose last colour is yellow. There is no zeroth colour in this one-based list. Checking positions nineteen, twenty and twenty-one gives green, yellow and red.
11. Circle. 2,026 divided by four leaves remainder two. The second entry is circle. The third entry happens to be circle as well, but that repeated symbol does not make the entire block shorter; triangle and square still distinguish the four-position structure.
12. B. Fifty equals sixteen complete three-position blocks plus two positions. The second symbol of A, B, A is B. The first and third A entries are different positions and must both remain in the repeating block.
13. Location 3. Sixteen of the nineteen moves make two complete eight-step circuits. The three remaining moves from zero reach three. Here remainder zero would correspond to returning to the starting location zero, unlike the one-based colour convention.
14. Location 5. Add the starting label to the clockwise movement: six plus fifteen is twenty-one. Remove sixteen, two complete circuits, to reach label five. Reducing fifteen to seven gives the residual movement, which must still be applied to the starting six.
15. Location 5. The five anticlockwise endpoints are one, zero, seven, six and five. This direct list verifies the wrap at zero. A formal calculation uses 2 − 5 = −3, which corresponds to five after adding one full circuit of eight.
16. Label 3; 3 p.m. the following day. Twenty-four hours returns to 10 a.m. on the next day, and five more hours reaches 3 p.m. The twelve-hour face remainder identifies the label but does not on its own record the elapsed day or morning/afternoon information.
Answers 17–24
17. 12:35 p.m. Fifteen minutes reaches noon, leaving thirty-five of the original fifty minutes. Alternatively, forty-five plus fifty is ninety-five minutes, one hour and thirty-five. The full time record carries the hour across noon rather than treating the display as a decimal number.
18. Thursday. One hundred days contains fourteen full weeks, ninety-eight days, plus two days. Move two days after Tuesday to Thursday. Counting Tuesday as Day 1 of a numbered list would answer a different question with only ninety-nine elapsed days.
19. 24 seconds. The first positive common multiple of six and eight is twenty-four. The initial time zero is a known coincidence but not the next one. Listing each schedule up to twenty-four verifies that no smaller positive time appears in both.
20. Day 13. A occurs on 3, 8, 13 and later days; B occurs on 1, 4, 7, 10, 13 and later days. Thirteen is their first shared entry. Fifteen is the repeat interval between coincidences, not the first coincidence, because the starting offsets differ.
21. 9. Positive powers of three have unit digits 3, 9, 7, 1 in a repeating four-step cycle. Exponent ten leaves remainder two on division by four, selecting the second entry. Multiplication by three returns the last digit one to three, verifying continuation of the cycle.
22. 10, 22, 34, 46. List values leaving remainder two on division by four, then retain those leaving remainder one on division by three. Starting at ten, adding twelve preserves both remainders. The previous value negative two and next value fifty-eight are outside the allowed range.
23. The claim is false. With a = 1 and b = 4, the doubles are two and eight, each with remainder two modulo six. The original values leave remainders one and four. This counterexample shows that cancelling a common factor in a modular relation needs conditions not supplied by the claim.
24. Five moves. The endpoints are 4, 8, 2, 6, 0. The total movement first becomes a multiple of ten at twenty steps, which requires five four-step moves. Every visited label is even, so the odd-labelled locations are never reached by this repeated jump from zero.
9. Repair indexing before increasing the numbers
A learner who can divide correctly may still choose the wrong pattern item because the starting convention is unclear. Ask whether the question counts displayed positions from one or elapsed moves from zero. Write the first few entries with their numbers before using a large position.
For repeated patterns, test the first entry, a full-cycle boundary and the next entry. For ring moves, test zero moves and one move from a non-zero start. These small checks isolate indexing errors more effectively than repeating a large division without changing the representation.
When remainder zero is treated as nothing to report
Use a four-colour strip and physically mark positions four, eight and twelve. They are all the last colour of a completed block. Then use a ring labelled zero to three and make four moves from zero. The endpoint is zero. The same completed-cycle idea has different labels because the two records start differently.
Ask the learner to explain the labels rather than learn an unexplained rule to “change zero to four.” That shortcut works for one-based four-item indexing but not for every clock, ring or code sequence.
When the cycle is guessed from too few terms
A short repeated-looking prefix does not guarantee an infinite repeating rule. The problems here state the repetition or establish it through a process, such as repeatedly multiplying a last digit. If the rule is not supplied, describe a proposed pattern as a hypothesis and check what would justify it.
This connects to the Logic guide. A few examples can suggest a cycle, while a transition rule can prove that reaching the same state will repeat the same future behaviour. The full state may contain more than the visible symbol, as the A, B, A example showed.
A practical teaching progression
Begin with counters grouped by a small divisor. Move to a repeating colour strip, then a numbered ring, then a hypothetical weekday calculation. Add non-zero starting points before introducing large counts. Only later use simultaneous remainder conditions or formal congruence notation.
At each step, ask what complete cycles may be discarded and which information must be retained. A clock face can discard complete twelve-hour circuits for its label, but an arrival-time question may still need the days and a.m./p.m. status. This prevents a useful simplification from erasing part of the required answer.
Remainders can organise a winning strategy
In a game where players remove one, two or three counters, certain pile sizes form repeating strategic classes. The Mathematical Games guide explains why a remainder pattern can become a strategy only after every legal reply is checked. The repeated numerical pattern alone is not enough.
The Probability guide provides a complementary contrast: a random outcome is not forced to follow a balancing cycle merely because a numerical pattern is observed. Remainder cycles describe deterministic repetition under stated rules; probability describes chance under a model.
Return to the BTT Primary Mathematics Learning Hub for arithmetic, time and listing prerequisites. The lasting question is: which part is a complete repetition, and which part still changes the answer?
Sources and scope
The MOE page supplies the official school-scope reference; this article is an enrichment guide. NRICH’s linked clock-arithmetic task supplies related further reading. The original examples, 24 questions, calculations and teaching sequence are self-contained. No real timetable, current calendar prediction, external assessment result or official examination requirement is asserted.