Only the last digit
7⁴ = 343 × 7 = 2401
Only 3 × 7 = 21 matters: last digit 1
The tens of 343 can't change the units
Maths olympiad · 45 minutes
Able students attack the last digit of 7²⁰²⁶ by trying small cases, see the cycles of last digits on a graph, prove that every cycle must repeat, and use remainders to finish. Slides to present, a vote that shows who's stuck, practice that climbs to olympiad problems, and homework.
Present and print without signing in.
Free. The whole lesson is copied into your Library, yours to change.
Each step is the last digit of aⁿ, for n = 1, 2, 3, … Start at a = 7, then move a. What do you see each time, and why must it happen?
At x = 1, 2, 3 …: 7, 9, 3, 1, 7, 9, 3, 1, 7, 9, 3, 1
The last digit of a product depends only on the last digits of the numbers multiplied, so the last digits of 7, 7², 7³, … go 7, 9, 3, 1, then again 7, 9, 3, 1. They must repeat: there are only ten possible last digits, and each one fixes the next. To find the last digit of 7²⁰²⁶, divide 2026 by the length of the cycle, 4: the remainder, 2, says where in the cycle it lands. This is arithmetic with remainders, made concrete: olympiads call it working modulo 10.
The lesson is problem first. Students meet a number with 1,713 digits and are asked for its last one, before anyone explains. They try small cases, spot the cycle, see the cycles of every digit on a graph, and only then say why a cycle must come back and how a remainder picks the answer. Practice climbs from single powers to sums of powers and short written proofs, which the teacher marks.
Students should know powers (7³ = 7 × 7 × 7), divide with a remainder, and tell from the last digit whether a number divides by 2, 5 or 10.
45 minutes in total. The stretch is optional.
5 min 1 · Hook · students think
Students attack the last digit of 7²⁰²⁶ before anyone explains.
“7²⁰²⁶ has 1,713 digits. No calculator shows them all. What is its last digit? You have three minutes, and no calculator.”
Students who multiply out whole numbers (16 807, 117 649 …) run out of time: ask which digits they really need.
Three minutes of silent work. The good move is to try small cases: 7¹, 7², 7³, … and look for a pattern.
Ask for their lists and a guess. Then the real questions: does the pattern go on for ever, and how do we use it for 2026?
Most begin 7, 49, 343, 2401. Collect their lists. Take a vote with Ask the class on the last digit: many will guess 7 or 1. Don't settle it yet.
Shorter: Give 7, 49, 343, 2401 at once; vote straight away (−2 min).
12 min 2 · Explain · you explain
Only the last digit matters; every cycle must repeat; a remainder picks the answer.
“Only the last digit can change the last digit. So keep only last digits, and see what happens.”
Remainder 0 read as the first in the cycle: it is the last, as 7⁴, 7⁸, 7¹² all end in 1.
Only the last digit
7⁴ = 343 × 7 = 2401
Only 3 × 7 = 21 matters: last digit 1
The tens of 343 can't change the units
Use the cycle
7ⁿ ends in 7, 9, 3, 1, then again
2026 = 4 × 506 + 2: remainder 2
The 2nd in the cycle: 7²⁰²⁶ ends in 9
First slide: 7⁴ = 343 × 7. Its last digit comes from 3 × 7 = 21 alone: the tens and hundreds only add tens and hundreds. So we keep only last digits: 7, then 7 × 7 = 49 → 9, then 9 × 7 = 63 → 3, then 3 × 7 = 21 → 1, then 1 × 7 → 7 again.
Second slide: the dots show the last digits of 7ⁿ for n = 1 to 12: 7, 9, 3, 1 three times.
Third slide: why it must repeat. There are only ten last digits, and each one fixes the next. So within ten steps a digit comes again, and from then on everything repeats. (This is the pigeonhole idea.)
Fourth slide: move a. Bases ending in 2, 3, 7, 8 repeat every 4; in 4 or 9 every 2; in 0, 1, 5, 6 never change. a = 12 looks just like a = 2: only the last digit of the base matters.
Fifth slide: use it. 2026 = 4 × 506 + 2, so 7²⁰²⁶ lands on the 2nd in the cycle: 9. The remainder by 4 can be read from the last two digits, because 100 is a multiple of 4: 26 leaves 2. Remainder 0 lands on the last in the cycle. Olympiads write this as 7²⁰²⁶ ≡ 9 (mod 10).
Vote before moving a (Ask the class): which a will have a cycle of length 1? Give the name 'modulo 10' only after students have said 'only the last digit matters' themselves.
Shorter: Skip moving a; show the four kinds of cycle on one slide (−4 min).
8 min 3 · Your turn · students write
Each worked example beside a twin that students solve themselves.
“Watch me: the cycle, the remainder, the place in the cycle. Then you do its twin.”
Adding last digits and writing 15: only the last digit of the sum counts.
One power
3²⁰²⁶: the cycle is 3, 9, 7, 1
2026 leaves 2 on dividing by 4
The 2nd in the cycle: 9
Then theirs
The last digit of 2²⁰²⁶
Remainder 0
7²⁰²⁴: 2024 leaves 0 on dividing by 4
Remainder 0: the last in the cycle
7, 9, 3, 1: so 1
Then theirs
The last digit of 8¹⁰⁰
A sum of powers
3⁵⁰ + 4⁵⁰: 50 leaves 2 on dividing by 4
3⁵⁰ ends in 9; 4ⁿ has a cycle of 2, and 50 is even: 6
9 + 6 = 15. Keep the last digit: 5
Then theirs
The last digit of 7²⁰²⁶ + 9²⁰²⁶
Work each example aloud in three moves: the cycle, the remainder, the place. Students solve its twin while you watch.
The second pair is the one that catches most: remainder 0 is the end of the cycle. The third pair adds two powers whose cycles have different lengths (4ⁿ and 9ⁿ repeat every 2), so check the cycle's length for each base.
Open the answers slide once most have finished their twins. Ask for the cycle, the remainder and the place for each.
Shorter: Do the first two pairs only (−3 min).
15 min 4 · Who's stuck? · students vote
One question shows who's stuck; then practice from single powers to olympiad sums and proofs.
“Choose an answer on your own. Nobody talks until everyone has chosen.”
Remainder 0 read as the first in the cycle; an even power read as the square; a last digit copied from the exponent.
Show your working: the cycle, the remainder, the place in the cycle. The last questions are proofs: check every possible last digit.
The question that shows who's stuck
Each wrong answer is a different mistake. While they answer, your Classroom shows who chose which, so you know in seconds whom to help with what.
Support · Write the cycle out, number its places 1, 2, 3, 4, and say which place remainder 0 is. For the proofs: list every possible last digit, 0 to 9, and check each one.
Everyone chooses before anyone explains. Then ask for the cycle, the remainder and the place in the cycle behind each answer: remainder 0, even powers and the 0 of 100 each pull some students to a different digit.
Questions 1–2 are single powers; 3–4 change the look; 5–6 ask why and link remainders; 7 is a proof by cases. 8–10 are olympiad level: sums of powers, a long sum, and a proof for every whole number.
Students write proofs on paper or the board; the quiz keeps their answers for you to mark and comment on.
If the class is split, write 3⁴, 3⁸, 3¹² and their last digits before practice. Long answers (7, 10) are marked by you: one mark for the idea (only the last digit matters), one for checking every case, one for the conclusion. Model answers are in each question's explanation.
Shorter: After the vote, questions 1–5 only (−6 min).
Longer: Swap and mark: pairs mark each other's proof of question 7, then 10 (+10 min).
5 min 5 · Exit · students show
One last digit, with the reason, shows who can use a cycle.
“Find the last digit of 8²⁰²⁶. Then say how the cycle tells you.”
A right digit with no cycle or remainder in the reason.
A digit, then a sentence or two.
What is the last digit of 8²⁰²⁶?
Say in a sentence or two how you know.
Wrong digits show who still miscounts the place in the cycle: start next time with remainder 0. Set the homework.
Longer: Then: the last digit of 8²⁰²⁶ − 2²⁰²⁶ (+5 min).
One to one: let the student work out 7¹ to 7⁶ on paper, keeping only the last digit, and ask them to spot when it starts again. Ask them to say the remainder, and where in the cycle it lands, before each answer.
For each, write the cycle, the remainder and the place in the cycle. Question 5 is a proof; question 7 is a challenge.
Print the worksheet with working space and homework. Teacher answers come with your Library copy.
The last digit of a product depends only on the last digits of the numbers multiplied, so each last digit of aⁿ fixes the next one. There are only ten possible last digits, so one must come round again within ten steps, and from then on the pattern repeats for ever.
Yes, made concrete. 'The same last digit' is what olympiad books write as ≡ (mod 10), and 'the remainder on dividing by 4' is working mod 4. The lesson names it once students have used it, so the notation means something when they meet it.
Last digits and remainders come up often in maths challenges and olympiads for students aged about 11 to 16, such as the UKMT Junior and Intermediate Mathematical Challenges and their follow-on olympiads. The problems are our own, written in that style, not taken from past papers.
Ask for three things every time: the cycle, the remainder, the place in the cycle. For the proofs, ask for the reason only the last digit matters and then every case, 0 to 9. The long questions are marked by you in Quizzes, with a comment, so the write-up gets feedback, not only the answer.
Yes. Read the lesson, print the worksheet and open its slides without signing in; nothing you draw there is kept. A free teacher account keeps the whole lesson in your Library to change and teach, with the quizzes, the answers and the answer slides.
Keep the whole lesson, change what you like, and use it with a group. Present its slides step by step while each student works on their own copy.
Free. The whole lesson is copied into your Library, yours to change.
In our own words; free to use with your students. Not endorsed by any exam board.