Modular Arithmetic for AMC 8: Remainders That Save Minutes

There is a particular kind of AMC 8 question that eats time. It asks for the remainder when some enormous number is divided by 7, or for the last digit of 3 raised to the 2027th power, or what day of the week it will be 1000 days from a Tuesday. A student who has not met modular arithmetic for AMC 8 starts multiplying, fills a page, and runs out of clock. A student who has met it writes one line and moves on.

That gap is not about talent. It is about knowing that these questions are not asking you to calculate anything at all.

The idea: only the remainder matters

Look at a clock. It is 10 o'clock, and you want to know the time 5 hours later. You do not answer 15. You answer 3, because after 12 the count starts again. You have just done modular arithmetic without naming it — you worked modulo 12.

The notation looks more intimidating than the idea. When we write

17 ≡ 5 (mod 12)

we are saying that 17 and 5 leave the same remainder when divided by 12, so on a clock they point to the same place. The symbol ≡ is read "is congruent to". That is the whole definition: two numbers are congruent modulo n when they leave the same remainder on division by n.

What makes this powerful in a competition is that you are allowed to replace any number by its remainder before doing the work, rather than after. If a question asks for the remainder when 47 × 53 is divided by 10, you do not need 2491. You need only that 47 leaves 7 and 53 leaves 3, and 7 × 3 = 21, which leaves 1. The answer is 1, reached without a single long multiplication.

The two rules, and the one that is not true

Almost everything in modular arithmetic for AMC 8 rests on two permissions and one prohibition.

You may add. If a ≡ b and c ≡ d (mod n), then a + c ≡ b + d (mod n).

You may multiply. Under the same conditions, a × c ≡ b × d (mod n). Repeated multiplication gives powers, which is why this rule does so much work.

You may not divide. This is where students lose marks, and it is worth seeing why rather than memorising it. Modulo 12, we know 6 × 2 = 12 ≡ 0 and 6 × 10 = 60 ≡ 0. Both products vanish, yet 2 and 10 are not congruent modulo 12. If division were permitted we could cancel the 6 and conclude 2 ≡ 10, which is false. So cancellation is simply not available, and an answer that depends on it is wrong even when it looks reasonable.

Work with the two permissions and avoid the third, and you will not go astray.

Cycles: the reason this beats calculation

Here is the property that turns a hard question into an easy one. Take the powers of 3 and record only their last digits:

3, 9, 27, 81, 243, 729, …
last digits: 3, 9, 7, 1, 3, 9, 7, 1, …

The last digits repeat with period 4, forever. Nothing else can happen: there are finitely many possible remainders, so a sequence of them must eventually repeat, and once it repeats once it repeats always.

Now the question "what is the last digit of 3²⁰²⁷?" becomes trivial. Divide 2027 by the cycle length 4 and take the remainder: 2027 = 4 × 506 + 3, so the remainder is 3. The third entry in the cycle is 7. The answer is 7, and you never computed a single power.

Every last-digit question is secretly a mod 10 question, because the last digit of a number is its remainder on division by 10. Once a student sees that, a whole family of AMC 8 problems collapses into one method.

Two cautions that cost real marks. First, count the cycle from the first power, not from zero — being one step out gives a plausible wrong answer that is on the options list. Second, when the remainder comes out as 0, you are at the last entry of the cycle, not the first.

Divisibility tests are modular arithmetic

Students learn early that a number is divisible by 3 when its digit sum is divisible by 3, and it is presented as a trick to memorise. It is not a trick; it is a short modular argument, and understanding it means you can rebuild any such test you forget.

The reason is that 10 ≡ 1 (mod 9). So 100 ≡ 1, 1000 ≡ 1, and every power of ten is congruent to 1 modulo 9. A number like 4271 is 4×1000 + 2×100 + 7×10 + 1, and replacing every power of ten by 1 gives 4 + 2 + 7 + 1 = 14. So 4271 leaves the same remainder as 14 modulo 9, and because 3 divides 9 the same argument works modulo 3.

The test for 11 falls out of the same reasoning with one change: 10 ≡ −1 (mod 11), so the powers of ten alternate 1, −1, 1, −1. That is exactly why the rule for 11 uses an alternating sum of digits. One idea, several tests, nothing to memorise.

Worked example, at AMC 8 difficulty

What is the remainder when 7¹⁰⁰ is divided by 5?

Start by reducing the base, because smaller numbers are easier: 7 ≡ 2 (mod 5), so 7¹⁰⁰ ≡ 2¹⁰⁰ (mod 5). Now list the powers of 2 modulo 5: 2, 4, 3, 1, then 2, 4, 3, 1 again. The cycle has length 4. Since 100 is a multiple of 4, we are at the end of a cycle, which is the entry 1.

The remainder is 1. Two lines, no calculator, no risk of an arithmetic slip halfway through a long multiplication.

Notice the order of operations in that solution: reduce the base first, then find the cycle, then use the exponent. Students who find the cycle of 7 directly get to the same place but with harder numbers, and harder numbers mean more mistakes under time pressure.

How to practise it so it is available under pressure

Knowing modular arithmetic and being able to use it in a forty-minute paper are different things. Three habits close that gap.

Reduce before you compute, always. Make it reflexive. If a number larger than the modulus appears anywhere in your working, replace it with its remainder immediately. Most errors in remainder problems are ordinary arithmetic slips inside unnecessarily large multiplications.

Write the cycle out fully the first time. Do not try to predict where it closes. Four or five terms is usually enough to see the repeat, and being certain costs less time than being wrong.

Use it to eliminate, not only to solve. AMC 8 is multiple choice with no penalty for a wrong answer, so a partial modular argument still has value. If you can establish only that the answer must be odd, or must leave remainder 2 modulo 3, that will often remove three options. Guessing between two is a far better position than leaving the question blank, and it takes seconds.

Where this leads

Modular arithmetic is not a topic that ends with the AMC 8. It is the entry point to number theory, and the same congruences reappear in the AMC 10 and AMC 12, in olympiad problems, and eventually in cryptography, where the security of ordinary internet traffic rests on facts about remainders modulo very large primes.

For a student in Class 6 or 7, that is a genuinely motivating thing to know: the clock arithmetic they are learning this month is the same mathematics that protects a bank transfer.

Registering for the AMC 8

The AMC 8 is 25 multiple-choice questions in 40 minutes, open to students in grade 8 and below. There is no penalty for a wrong answer, which is why the elimination habit above matters so much — a blank scores the same as a wrong answer, so there is never a reason to leave one.

One point surprises many families: students do not register directly with the Mathematical Association of America. Registration is handled by a school, university, math circle or learning centre through its Competition Manager, who orders the competition and administers it on site. If your child's school does not participate, you will need to find a local institution that does — and that is worth starting early, because deadlines close well before the competition week.

Check maa.org/amcreg for the current cycle's dates, deadlines and fees, which change each year. If you would like help finding a registration centre or preparing for the paper, our AMC 8 preparation course covers number theory alongside the other three AMC 8 strands, and the AMC 8 masterclass goes further into competition strategy. Students who finish the AMC 8 strongly usually move on to AMC 10 preparation the following year.