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. /A puzzle card asks for two remainders without a calculator…
HardMathematicsHigh School (11–12)Number TheoryNumericalOlympiad

A puzzle card asks for two remainders without a calculator…

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.

A puzzle card asks for two remainders without a calculator. The first is the remainder when 32003^{200}3200 is divided by 131313. The second is the remainder when 2772^{77}277 is divided by 999. For each one, find the smallest positive power of the base that is congruent to 111, then use it to cut the exponent down. Give both remainders.

Check your answer

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

Need a reminder? The key ideaShowHide

a≡b(modm)a \equiv b \pmod ma≡b(modm) means m∣a−bm \mid a - bm∣a−b. Congruences add, subtract, multiply and take powers like equations. A small power congruent to 111 or −1-1−1 cuts a large exponent down:

ak≡1(modm) ⇒ aqk+r≡ar(modm).\displaystyle a^k \equiv 1 \pmod m \ \Rightarrow\ a^{qk + r} \equiv a^r \pmod m.ak≡1(modm) ⇒ aqk+r≡ar(modm).

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. The powers 32003^{200}3200 and 2772^{77}277 and the moduli 131313 and 999.

Plan. Find a small power that is 111, then divide the exponent by its size.

Step 1. The powers of 3 modulo 13. 31=33^1 = 331=3, 32=93^2 = 932=9, 33=27=2×13+1≡13^3 = 27 = 2 \times 13 + 1 \equiv 133=27=2×13+1≡1.

Step 2. Cut the exponent. 200=3×66+2200 = 3 \times 66 + 2200=3×66+2. So 3200=(33)66⋅32≡1⋅9=9(mod13)3^{200} = (3^3)^{66} \cdot 3^2 \equiv 1 \cdot 9 = 9 \pmod{13}3200=(33)66⋅32≡1⋅9=9(mod13).

Step 3. The powers of 2 modulo 9. 2,4,8,16≡7,14≡5,10≡12, 4, 8, 16 \equiv 7, 14 \equiv 5, 10 \equiv 12,4,8,16≡7,14≡5,10≡1. So 26≡1(mod9)2^6 \equiv 1 \pmod 926≡1(mod9).

Step 4. Cut the exponent. 77=6×12+577 = 6 \times 12 + 577=6×12+5. So 277≡25=32≡5(mod9)2^{77} \equiv 2^5 = 32 \equiv 5 \pmod 9277≡25=32≡5(mod9).

Check. A shortcut for the second: 23=8≡−1(mod9)2^3 = 8 \equiv -1 \pmod 923=8≡−1(mod9). Then 277=(23)25⋅22≡(−1)25⋅4=−4≡52^{77} = (2^3)^{25} \cdot 2^2 \equiv (-1)^{25} \cdot 4 = -4 \equiv 5277=(23)25⋅22≡(−1)25⋅4=−4≡5. The same answer.

Answer: the remainders are 999 and 555.

Log in to save this for later
← All Problems
← Find all positive whole numbers n for which n² + 5n + 30 is a perfect square…Show that n⁵ - n is a multiple of 30 for every integer 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 →