HelpContactFor teachers and institutes
>_StemPy Lab
Mock TestsClasses

>_StemPy Lab

Learn. Solve. Code the solutions. Test yourself.

Live examsFree mock exams, timed and rankedEveryone starts together, and your score and rank come the moment it ends.See the exams →
Live examsInternational live exams are comingTell us which exam you want first. Timed practice papers are open now.See what is coming →

Learn

  • Physics
  • Chemistry
  • Mathematics
  • Biology
  • Python Programming
  • Statistics & Data Science
  • Computer Science
  • Space Science and Astronomy
  • Classes
  • Groups

Practice

  • Problems
  • Quizzes
  • Mock Tests
  • Prepare for an Exam
  • Question Sets
  • Exams
  • Certificates
  • Python Labs
  • AI Practice Generator
  • Student-Created Tests

Community

  • Discussions
  • Resources
  • Notes
  • Glossary
  • Blog

Account

  • Log in
© 2026 senLearn. All rights reserved.HelpFor SchoolsAboutContactPrivacy PolicyTerms of UseRefund Policy
  1. Problems
  2. /Find the last two digits of 13²⁰²⁶, that is, its remainder on division by 100…
HardMathematicsHigh School (11–12)Number TheoryNumericalOlympiad

Find the last two digits of 13²⁰²⁶, that is, its remainder on division by 100…

StemPy LabContributed by StemPy Lab

Try it on paper first. A hint, the key idea and the worked solution are here when you need them.

Find the last two digits of 13202613^{2026}132026, that is, its remainder on division by 100100100. First find φ(100)\varphi(100)φ(100) and use Euler's theorem to cut the exponent down. Then finish with repeated squaring, keeping only two digits at each step. Give φ(100)\varphi(100)φ(100), the reduced exponent and the remainder on division by 100100100.

Check your answer

Work it out on paper, then type your number. The answer itself stays hidden.

Need a reminder? The key ideaShowHide

φ(n)\varphi(n)φ(n) counts 1≤k≤n1 \le k \le n1≤k≤n with gcd⁡(k,n)=1\gcd(k, n) = 1gcd(k,n)=1. If gcd⁡(a,n)=1\gcd(a, n) = 1gcd(a,n)=1, Euler's theorem gives

aφ(n)≡1(modn),φ(n)=n∏p∣n(1−1p).\displaystyle a^{\varphi(n)} \equiv 1 \pmod n, \qquad \varphi(n) = n\prod_{p \mid n}\left(1 - \tfrac{1}{p}\right).aφ(n)≡1(modn),φ(n)=np∣n∏​(1−p1​).

The worked solution

Check an answer or open a hint to unlock the worked solution.

Have you tried it?

Work it out on paper first. It is fine to get stuck or make a mistake: that is how we learn. When you are ready, go through the solution one step at a time, and check each step against your own.

Given. 13202613^{2026}132026 modulo 100100100, with gcd⁡(13,100)=1\gcd(13, 100) = 1gcd(13,100)=1.

Step 1. Euler. φ(100)=40\varphi(100) = 40φ(100)=40, so 1340≡1(mod100)13^{40} \equiv 1 \pmod{100}1340≡1(mod100).

Step 2. Cut. 2026=40×50+262026 = 40 \times 50 + 262026=40×50+26, so 132026≡132613^{2026} \equiv 13^{26}132026≡1326.

Step 3. Square. 132=169≡6913^2 = 169 \equiv 69132=169≡69, and 134≡692=4761≡6113^4 \equiv 69^2 = 4761 \equiv 61134≡692=4761≡61. Then 135≡61×13=793≡9313^5 \equiv 61 \times 13 = 793 \equiv 93135≡61×13=793≡93, 1310≡932=8649≡4913^{10} \equiv 93^2 = 8649 \equiv 491310≡932=8649≡49 and 1320≡492=2401≡113^{20} \equiv 49^2 = 2401 \equiv 11320≡492=2401≡1.

Step 4. Finish. 1326=1320⋅134⋅132≡1×61×69=4209≡913^{26} = 13^{20} \cdot 13^4 \cdot 13^2 \equiv 1 \times 61 \times 69 = 4209 \equiv 91326=1320⋅134⋅132≡1×61×69=4209≡9.

Check. Since 1320≡113^{20} \equiv 11320≡1 already, 1326≡136=134⋅132≡61×69≡913^{26} \equiv 13^6 = 13^4 \cdot 13^2 \equiv 61 \times 69 \equiv 91326≡136=134⋅132≡61×69≡9. The same answer, with less work.

Answer: φ(100)=40\varphi(100) = 40φ(100)=40, the exponent reduces to 262626, and the last two digits are 090909, a remainder of 999.

Watch out. A last-two-digits answer below 101010 has a leading zero: the number ends in 090909, not in 999 alone.

Log in to save this for later
← All Problems
← A music teacher divides a 360-beat cycle into fractions k/360 for k = 1, 2, …, 359…Prove that Σ_(d mid n)φ(d) = n for every positive integer n, by sorting the fractions 1/n, 2/n, …… →
More onNumber Theory

Discussion (0)

Log in to join the discussion.

Loading…

More on this topic

  1. The triangular numbers are 1, 3, 6, 10, …, where the nth one is (n(n + 1))/2…Advanced
  2. Prove that the equation x³ + y³ + z³ = n has no solution in integers when n leaves remainder 4 or 5…Advanced
  3. Find every triple of positive integers a ≤ b ≤ c with 1/a + 1/b + 1/c = 1, and prove that there are…Advanced
  4. Find all pairs of positive integers (x, y) with x² - y² = 945…Hard
  5. A teacher wants a list of every primitive Pythagorean triple whose hypotenuse is less than 100…Advanced
All problems on this topic →