Free • no sign-in • printable and mobile-friendly • core lesson 45–60 minutes
Help students turn a pattern into an explanation. This remainders lesson has two starting checks, two worked examples, six original exercises with progressive hints, a final transfer question and full teacher solutions. Use P1–P4 as the core and P5–P6 as optional extensions.
You may print and share this unmodified free pack for teaching and personal study. Keep the attribution. Share this page with your class; no email address or account is required. These are original foundation problems, not an official exam or a full national mock.
Teach the core in 45–60 minutes
Foundational secondary-school learners who can divide nonnegative integers and multiply small whole numbers. Suitable for building first-stage problem-solving skills across countries; no official contest alignment is claimed.
- 5 minutes: D1–D2: diagnose valid remainders and cycle indexing. Ask for the reason as well as the answer.
- 6 minutes: Teach the division statement and why addition or multiplication can use remainders. Keep the symbolic product expansion available for learners who need the proof.
- 10 minutes: Model E1 and E2. Ask a learner to identify the exact repeated state and the rule that forces repetition.
- 16 minutes: Learners attempt P1–P4. Give Hint 1 first, allow another attempt, then offer Hint 2. Pair discussion should focus on why the answer list or cycle is complete.
- 8 minutes: Use the paper-to-practice routine on the existing lesson. Treat this as a flexible allowance; move it to follow-up if learners need longer.
- 5 minutes: Retry one original paper question, then write which step changed in the learner's explanation.
- 8 minutes: Complete X1 and review its cycle argument. Use any remaining time to introduce P5 or P6 as a follow-up extension.
Use D1–D2, the two examples and P1–P3 in class. Use P4 as a quick oral transfer check if time allows. Keep X1 as the final written check and move the online session plus P5–P6 to follow-up. Do not rush the starting-index explanation to finish every page.
Support, stretch and common mistakes
If D1 fails, use counters or small drawn groups before algebraic notation. Ask the learner to identify a full group inside the claimed remainder.
If D2 fails, number a physical or drawn colour strip. Compare a list beginning at position 1 with a marker sequence whose start is move 0.
For E1 and P2, draw a circle with the stated labels and trace only one complete cycle. No geometry measurement is involved.
In P3, provide three empty rows headed r = 0, 1, 2, but let learners calculate the outcomes and explain why these are all the rows needed.
If repeated digits are unfamiliar, build 2 → 22 → 222 before introducing the update 10N + 2.
Assign P5 when learners can explain why a repeated state forces a repeated future. Ask why returning to remainder 0 matters even though the actual integer keeps growing.
Assign P6 as a written proof. Require both directions: every proposed exponent works, and the remaining exponent class fails.
Do not introduce Euler's theorem, Fermat's theorem or modular inverses; the intended tools are division, small multiplication and complete cases.
- Accepting a leftover that is at least the divisor as a remainder. Regroup another full set and check 0 ≤ r < d. Use D1.
- Treating remainder 0 as no answer, or always selecting the first entry of a position-1 list. Mark the starting index. In a move sequence, complete cycles return to the starting state. In D2, a position divisible by 4 is the final colour of a block.
- Announcing a cycle from a few terms without explaining why the rest repeats. Point to the exact repeated state and the unchanged update rule. Then explain why each following state is forced to repeat.
- Using only a few sample values to prove an impossible remainder. List every remainder of the input on division by the relevant divisor, as in P3.
- Finding one working index when the question asks for all of them. State the relevant index remainder, list its values in the permitted interval and check the values immediately outside the interval.
- Treating an online session completion as proof that every question was solved independently. Review which answers needed a hint or requested solution, then retry one original question without that support.
Try these before the lesson
D1 · Starting check
A student writes 43 = 6 × 6 + 7 and says that 43 leaves remainder 7 when divided by 6. The equality is correct. Is the claimed remainder correct? Explain and write the valid division statement.
Worked solution — open after your attempt
- The equality is correct, but a remainder on division by 6 must be one of 0, 1, 2, 3, 4 or 5.
- The seven leftover counters contain another full group of six, with one counter left.
- Therefore 43 = 6 × 7 + 1. The quotient is 7 and the remainder is 1.
D2 · Starting check
The colours Red, Blue, Green, Yellow repeat in that order. Position 1 is Red. What colours are in positions 8 and 9? Explain where each position falls in the repeated four-colour blocks.
Worked solution — open after your attempt
- Positions 1–4 form the first block and positions 5–8 form the second block.
- Position 8 is the fourth position of a complete block, so it is Yellow.
- Position 9 starts the next block, so it is Red. A count divisible by 4 ends a complete block; it does not mean there is a colour in position 0.
Why the method works
For a nonnegative integer N and a positive integer d, division with remainder means writing N = dq + r, where q is a nonnegative integer and 0 ≤ r < d. The number q counts complete groups of size d. The number r counts what remains. Remainder 0 is allowed: it means the groups use everything.
A number and its remainder differ by a multiple of the divisor. For example, on division by 7, 18 and 4 have the same remainder because 18 = 7 × 2 + 4. Adding 3 to both keeps their difference a multiple of 7. Multiplying both by 4 also keeps their difference a multiple of 7. This is why we can use small remainders during a long calculation.
The same idea works for a product. Let A and B be nonnegative integers and let d be a positive divisor. Write A = dq + r and B = dt + s. Here q and t count complete groups of size d; r and s are the respective remainders. Multiplying the two expressions gives AB = d²qt + dqs + drt + rs = d(dqt + qs + rt) + rs. Each of the first three terms contains a factor d. Therefore AB and rs differ by a multiple of d and have the same remainder. If rs is at least d, divide rs once more to get a remainder smaller than d. We may add and multiply remainders this way; this pack does not use division of remainders.
To investigate a cycle, record the starting state and apply the same update rule repeatedly. If you return to the starting state, the same rule gives the same next state, then the same following state, and so on. This proves repetition. A few similar-looking entries are only a clue; identify the exact return and the rule that forces the rest.
Keep the index visible. A marker's starting position is its position after 0 moves. Powers begin here at exponent 0, with a0 = 1 for positive a. The colours in D2 were instead numbered from position 1. A zero remainder in the step count means complete cycles with no extra moves, but its interpretation depends on where the numbering starts.
A complete remainder argument considers every permitted remainder. On division by d, the list 0, 1, …, d − 1 covers every integer in this pack. A table using all those cases can prove that a proposed remainder is impossible; a table containing only a few chosen input values cannot do that.
One useful change of representation appears in Exercise 5. Appending digit 2 to a whole number N produces 10N + 2. For example, appending 2 to 22 gives 10 × 22 + 2 = 222. To track its remainder, multiply the old remainder by 10, add 2, and divide by the chosen divisor again.
Two worked examples
E1 · Follow a short cycle instead of making 35 moves
Six places around a circle are labelled 0, 1, 2, 3, 4, 5 in clockwise order. A marker starts at 0. Each move advances it exactly four places clockwise, wrapping around the circle. Where is it after 35 moves? Justify the cycle you use.
Read the worked example
- Record the position after each move, including the start: after 0 moves it is at 0; after 1 move it is at 4; after 2 moves it is at 2; after 3 moves it is back at 0.
- For the second move, 4 + 4 = 8 leaves remainder 2 on division by 6. For the third, 2 + 4 = 6 leaves remainder 0.
- The same move rule now starts again from 0. It must produce 4, then 2, then 0 again. Therefore blocks of three moves repeat.
- Write 35 = 3 × 11 + 2. The first 33 moves are eleven complete cycles and return the marker to 0.
- The two extra moves take it to 4 and then 2. Its position after 35 moves is 2.
E2 · Track a power by its remainder
Find the remainder of 420 on division by 7. Then decide whether 421 − 1 is divisible by 7. Explain the repeated pattern rather than calculating the large powers.
Read the worked example
- Begin at exponent 0. The value 40 = 1 has remainder 1. Each increase in the exponent multiplies the preceding power by 4.
- Starting with remainder 1, the next remainder is 4. Multiplying 4 by 4 gives 16, with remainder 2. Multiplying 2 by 4 gives 8, with remainder 1.
- We have returned to remainder 1 after three multiplications. Repeating the same multiply-by-4 rule gives the cycle 1, 4, 2, indexed by exponents with remainders 0, 1, 2 on division by 3.
- Since 20 = 3 × 6 + 2, the exponent has remainder 2 on division by 3. The corresponding remainder of 420 on division by 7 is 2.
- Since 21 = 3 × 7, the power 421 has remainder 1 on division by 7. Subtracting 1 leaves remainder 0. Thus 421 − 1 is divisible by 7.
- As a check on the reason for the cycle, 43 = 64 = 7 × 9 + 1. Multiplying by another block of 43 leaves a remainder unchanged.
| Exponent k | 0 | 1 | 2 | 3 |
|---|---|---|---|---|
| Remainder of 4k on division by 7 | 1 | 4 | 2 | 1 |
Exponents repeat their position every 3 steps; the power remainders are calculated on division by 7.
Six original exercises
Try on paper. If stuck, use Hint 1 and try again before opening Hint 2. The worksheet exercises below are static; the linked online practice uses a separate adaptive bank.
P1 · Core 1 — make the list complete
Find all integers N with 30 ≤ N ≤ 60 that leave remainder 5 when divided by 8. Explain why your list is complete.
Hint 1
Write a number with the required remainder as 8q + 5, where q is a nonnegative integer.
Hint 2
Find the last such number below 30, then add 8 until you pass 60.
Worked solution — open after your attempt
- Every permitted number has the form N = 8q + 5.
- For q = 3 this is 29, which is below the allowed interval. For q = 4, 5 and 6 it gives 37, 45 and 53.
- For every q ≤ 3, the value 8q + 5 is at most 29, below the interval. For every q ≥ 7, it is at least 61, above the interval. Thus only q = 4, 5, 6 are possible.
- Therefore the complete list is 37, 45, 53. Checking division gives 37 = 8 × 4 + 5, 45 = 8 × 5 + 5 and 53 = 8 × 6 + 5.
P2 · Core 1 — track the start and reachable places
Eight places around a circle are labelled 0, 1, 2, 3, 4, 5, 6, 7 in clockwise order. A marker starts at 3 and advances exactly six places clockwise on every move. Find its position after 38 moves. Also list all places it can ever occupy, including the starting place, and justify that list.
Hint 1
Write the positions after 0, 1, 2, 3 and 4 moves. Reduce each position to a remainder from 0 to 7.
Hint 2
Once the marker returns to 3, the same moves repeat. Divide 38 by the number of moves in this cycle.
Worked solution — open after your attempt
- The positions after 0, 1, 2, 3 and 4 moves are 3, 1, 7, 5, 3. For instance, the first move gives 3 + 6 = 9, with remainder 1 on division by 8.
- After four moves we return to the starting place. Because the update rule is unchanged, the four-move block repeats forever.
- Since 38 = 4 × 9 + 2, nine complete cycles are followed by two extra moves. Starting again at 3, those moves go to 1 and then 7. The requested position is 7.
- The only occupied places are 1, 3, 5 and 7. Each appears in the first cycle, and every later move repeats a place in that cycle. This establishes both that all four occur and that no other place can occur.
P3 · Core 2 — use all remainder cases
For a nonnegative integer n, which remainders can n(n + 2) leave when divided by 3? Give an example for each possible remainder and prove that your list covers every n.
Hint 1
The remainder of n on division by 3 must be 0, 1 or 2. Treat these as three cases.
Hint 2
For each remainder r, calculate r(r + 2) and reduce that result on division by 3. Explain why replacing n by r is allowed.
Worked solution — open after your attempt
- Let r be the remainder of n on division by 3. The possibilities r = 0, 1, 2 cover every nonnegative integer n.
- The numbers n and r differ by a multiple of 3. Hence n + 2 and r + 2 also differ by a multiple of 3. The product rule in the theory shows that n(n + 2) and r(r + 2) have the same remainder.
- If r = 0, then r(r + 2) = 0, with remainder 0. If r = 1, the product is 3, again with remainder 0. If r = 2, the product is 8, with remainder 2.
- Thus the only possible remainders are 0 and 2. Both occur: n = 0 gives product 0, and n = 2 gives product 8.
- Remainder 1 is impossible because all three possible remainder cases for n have been examined.
P4 · Core 2 — reverse a cycle question
Among the integers k with 0 ≤ k ≤ 14, find every k for which 4k leaves remainder 2 on division by 7. How many such exponents are there?
Hint 1
Use the power cycle established in Example E2, including the starting exponent 0.
Hint 2
Remainder 2 occurs at exponents of the form 3q + 2. List these inside the given interval.
Worked solution — open after your attempt
- Example E2 proves that the remainders of 4k on division by 7 are 1, 4, 2 for exponent remainders 0, 1, 2 on division by 3.
- Therefore the required exponents are exactly those with remainder 2 on division by 3: k = 3q + 2.
- Within 0 ≤ k ≤ 14, the choices are 2, 5, 8, 11 and 14, obtained from q = 0, 1, 2, 3, 4.
- The preceding value would be −1 and the next would be 17, both outside the interval. Thus the list is complete and contains five exponents. Exponent 0 is included in the search interval but does not work, since 40 = 1.
P5 · Extension — discover the update rule
For a positive integer k, let Nk be the decimal integer made of exactly k copies of the digit 2. Thus N1 = 2, N2 = 22 and N3 = 222. Find all k with 1 ≤ k ≤ 30 for which Nk is divisible by 7. Prove that you have not missed a value of k.
Hint 1
Appending one digit 2 gives Nk+1 = 10Nk + 2. Track only the remainder on division by 7.
Hint 2
For convenient starting notation set N0 = 0. From remainder r, the next remainder is that of 10r + 2. Continue until you return to remainder 0.
Worked solution — open after your attempt
- Use N0 = 0 only as a starting value for the update. For positive k, Nk has exactly the decimal digits stated in the question.
- Appending 2 gives Nk+1 = 10Nk + 2. If Nk has remainder r on division by 7, the next number has the same remainder as 10r + 2, because their difference is ten times a multiple of 7.
- The remainders at k = 0, 1, 2, 3, 4, 5, 6 are 0, 2, 1, 5, 3, 4, 0. The calculations after the start are 2; 22 = 7 × 3 + 1; 12 = 7 + 5; 52 = 7 × 7 + 3; 32 = 7 × 4 + 4; and 42 = 7 × 6 + 0.
- The remainder has returned to 0 after six updates. The same update rule then repeats exactly the same block. Within that block, remainder 0 occurs only at its end, so a positive k gives remainder 0 exactly when k is a positive multiple of 6.
- Between 1 and 30 these values are 6, 12, 18, 24 and 30. These and only these give divisibility by 7. The artificial starting index 0 is excluded by the question.
P6 · Proof extension — combine two cycles
Find all nonnegative integers n for which 4n + 2n + 1 is divisible by 7. Prove that your description is necessary and sufficient.
Hint 1
You already know the remainders of 4n. Make a second list for 2n, starting at n = 0.
Hint 2
Both lists repeat after three exponent steps. Add their remainders and 1 separately for n having remainder 0, 1 or 2 on division by 3.
Worked solution — open after your attempt
- For 2n, the remainders on division by 7 begin at 1 when n = 0. Multiplying by 2 gives 2, then 4, then 8 with remainder 1. The same rule therefore repeats the cycle 1, 2, 4.
- Example E2 gives the cycle 1, 4, 2 for 4n. Both cycles are indexed by the remainder of n on division by 3.
- If n has remainder 0 on division by 3, the sum 4n + 2n + 1 has the same remainder as 1 + 1 + 1 = 3. It is not divisible by 7.
- If n has remainder 1, the corresponding sum of remainders is 4 + 2 + 1 = 7, which has remainder 0. If n has remainder 2, it is 2 + 4 + 1 = 7, again with remainder 0.
- Every nonnegative integer n lies in exactly one of these three cases. Thus divisibility holds precisely for n = 3q + 1 or n = 3q + 2, where q is any nonnegative integer. This proves both that every listed n works and that no other n works.
- The boundary case n = 0 belongs to the excluded first case: 40 + 20 + 1 = 3.
A new update rule: final check
X1 · Final check
Start with t = 0. On each move replace t by the remainder of 3t + 1 on division by 5, so the displayed value is always one of 0, 1, 2, 3, 4. What is displayed after 100 moves? Explain why the cycle you use must repeat.
Worked solution — open after your attempt
- Starting at 0, the next value is 1. From 1 the next value is 4. From 4, 3 × 4 + 1 = 13 has remainder 3. From 3, 3 × 3 + 1 = 10 has remainder 0.
- Thus the values after 0, 1, 2, 3, 4 moves are 0, 1, 4, 3, 0. The same rule has returned to the same starting value, so the four-move block repeats.
- Since 100 = 4 × 25, there are twenty-five complete blocks and no extra moves. The display is 0. Here index 0 is the starting state, so a multiple of the cycle length returns to that state.
Review one written answer
- I stated the permitted input values and the relevant divisor or starting index.
- My remainder calculations are valid and every remainder is between 0 and one less than the divisor.
- I explained why my cycle repeats or why my cases cover every allowed input.
- I answered the whole question, checked the boundary or zero-remainder case when relevant, and can explain the answer after closing the solution.
Mark each criterion as shown, needs a repair or not relevant to this question. Then label the attempt independent, hint-supported or solution-assisted. Choose one repair before attempting a harder problem.
Practise the missing step, then retry your question
Circle one question you could not explain. Choose the remainders lesson for cycles, or divisibility if exact division is unclear. For a simpler two-case pattern, try parity.
Start free six-question practice →
- Start the existing adaptive session. Its questions come from the site's existing bank; they are not the six static worksheet exercises in this pack.
- Work through six responses. Requested solutions count as responses, so completing the session does not mean six independently correct answers or mastery.
- Choose “See my session summary”, then “Review all 6 answers and explanations”. Notice one answer that you could not yet explain independently.
- Return to the paper. Use the return-to-paper option when it is present; otherwise use your browser's Back control or reopen the printed sheet.
- Retry the circled original question without copying its solution. State the step that now makes sense. If you still need help, use Hint 1 and mark the retry as supported.
If devices are unavailable, compare a written attempt with the numbered solution, close the solution and retry the original problem. The printable pack remains usable without an account or an online session.
No sign-in is needed; progress saving is optional. Keep this pack in a tab or on paper. A session completion means six responses, including requested solutions, not six independent correct answers or mastery.
Choose your next paper at the right stage
Apply the skill to a problem from your own stage: Singapore SMO study route, Japan JMO/JJMO study route, or UKMT and BMO study route. The mock catalogue distinguishes the countries and stages with published original papers.
Already preparing for India? Choose IOQM Mock 1 for answer-only practice or RMO Mock 1 for written proofs. These are full papers and considerably broader than this one-topic lesson.
Share it with your class
Copy this page’s address into your normal class resource list or share the student PDF directly. The separate teacher key makes it easy to keep solutions closed during an attempt. Students can also share the public lesson link after practice; no answers, scores or personal details need to be shared.
Created 15 October 2026 for IMOolympiad.com with AI assistance. The mathematics and solution accessibility were checked by separate AI reviewers, and the PDFs were visually inspected. No human review or organiser endorsement is claimed. Report a correction.