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 six-digit number is called a repeater when its last three digits repeat its first three, like…
HardMathematicsHigh School (11–12)Number TheoryConceptualNumericalOlympiad

A six-digit number is called a repeater when its last three digits repeat its first three, like…

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 six-digit number is called a repeater when its last three digits repeat its first three, like abcabc‾\overline{abcabc}abcabc with a≠0a \ne 0a=0. One example is 257257257257257257.

  1. Prove that every repeater is divisible by 777, by 111111 and by 131313.
  1. How many repeaters are divisible by 171717?
  1. How many repeaters are divisible by 121212?

Explain each count.

Check your answer

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

Need a reminder? The key ideaShowHide

A number and its digit sum leave the same remainder on division by 999. A number and its alternating sum leave the same remainder on division by 111111. The last kkk digits decide divisibility by 2k2^k2k and 5k5^k5k. Also a−b∣an−bna - b \mid a^n - b^na−b∣an−bn.

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.

Plan. Every repeater is 100110011001 times a three-digit number m=abc‾m = \overline{abc}m=abc, with 100≤m≤999100 \le m \le 999100≤m≤999.

Step 1. Part (a). abcabc‾=1000m+m=1001m\overline{abcabc} = 1000m + m = 1001mabcabc=1000m+m=1001m, and 1001=7×11×131001 = 7 \times 11 \times 131001=7×11×13. So 777, 111111 and 131313 all divide it.

Step 2. Part (b). 171717 is a prime that does not divide 100110011001. By Euclid's lemma, 17∣1001m17 \mid 1001m17∣1001m exactly when 17∣m17 \mid m17∣m. The multiples of 171717 from 100100100 to 999999999 run from 17×6=10217 \times 6 = 10217×6=102 to 17×58=98617 \times 58 = 98617×58=986. That is 58−6+1=5358 - 6 + 1 = 5358−6+1=53 numbers.

Step 3. Part (c). 12=4×312 = 4 \times 312=4×3, and neither 222 nor 333 divides 100110011001. So 12∣1001m12 \mid 1001m12∣1001m exactly when 12∣m12 \mid m12∣m. The multiples of 121212 from 100100100 to 999999999 run from 12×9=10812 \times 9 = 10812×9=108 to 12×83=99612 \times 83 = 99612×83=996. That is 83−9+1=7583 - 9 + 1 = 7583−9+1=75 numbers.

Answer: every repeater is divisible by 777, 111111 and 131313; 535353 repeaters are divisible by 171717 and 757575 by 121212. Proof complete.

Check. The program in the lab can count all 900900900 repeaters directly and gives the same numbers.

Log in to save this for later
← All Problems
← A label on a box of 72 equal packets shows the total mass in grams as a five-digit number 6a49b…A machine can print only the digits 0 and 1… →
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 →