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 twelve-digit serial number is N = 123 456 789 123…
HardMathematicsHigh School (11–12)Number TheoryNumericalOlympiad

A twelve-digit serial number is N = 123 456 789 123…

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 twelve-digit serial number is N=123 456 789 123N = 123\,456\,789\,123N=123456789123. A clerk needs its remainders on division by 777, 111111 and 131313, but has no calculator. Use 1000≡−11000 \equiv -11000≡−1 for each of these three moduli, which holds because 1001=7×11×131001 = 7 \times 11 \times 131001=7×11×13. Split NNN into blocks of three digits from the right, form the alternating sum of the blocks, and reduce it. Find the three 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. N=123×10003+456×10002+789×1000+123N = 123 \times 1000^3 + 456 \times 1000^2 + 789 \times 1000 + 123N=123×10003+456×10002+789×1000+123.

Plan. Replace 100010001000 by −1-1−1 for each modulus.

Step 1. The alternating sum. N≡−123+456−789+123=−333N \equiv -123 + 456 - 789 + 123 = -333N≡−123+456−789+123=−333 for each of the moduli 777, 111111 and 131313.

Step 2. Modulo 7. −333+336=3-333 + 336 = 3−333+336=3, and 336=48×7336 = 48 \times 7336=48×7. So N≡3(mod7)N \equiv 3 \pmod 7N≡3(mod7).

Step 3. Modulo 11. −333+341=8-333 + 341 = 8−333+341=8, and 341=31×11341 = 31 \times 11341=31×11. So N≡8(mod11)N \equiv 8 \pmod{11}N≡8(mod11).

Step 4. Modulo 13. −333+338=5-333 + 338 = 5−333+338=5, and 338=26×13338 = 26 \times 13338=26×13. So N≡5(mod13)N \equiv 5 \pmod{13}N≡5(mod13).

Check. The test by 111111 with single digits gives the same: the alternating sum of the digits from the right is 3−2+1−9+8−7+6−5+4−3+2−1=−3≡8(mod11)3 - 2 + 1 - 9 + 8 - 7 + 6 - 5 + 4 - 3 + 2 - 1 = -3 \equiv 8 \pmod{11}3−2+1−9+8−7+6−5+4−3+2−1=−3≡8(mod11).

Answer: the remainders are 333, 888 and 555.

Log in to save this for later
← All Problems
← A number theorist wants to prove that no integer of the form 8k + 7 is a sum of three squares of…A machine prints a code x from 0 to 37 that must satisfy 14x ≡ 22 pmod38… →
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 →