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 clock face has 8 marks, numbered 0 to 7…
HardMathematicsHigh School (11–12)Mathematical InductionNumericalConceptualOlympiadWBJEE
+2 more exams
A-LevelIB
OlympiadA-LevelIB

A clock face has 8 marks, numbered 0 to 7…

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 clock face has 888 marks, numbered 000 to 777. A pointer starts at mark 000 and moves forward 32n−13^{2n} - 132n−1 marks in round nnn. A student claims that after every round the pointer is back at mark 000, which means that 888 divides 32n−13^{2n} - 132n−1 for every n≥1n \ge 1n≥1.

  1. Prove the claim by induction.
  1. Find the whole number 32n−18\dfrac{3^{2n} - 1}{8}832n−1​ when n=3n = 3n=3.
  1. In another game the pointer moves 32n+13^{2n + 1}32n+1 marks instead. At which mark does it stop each time? Use part (a).

Show the add-and-subtract step clearly, and say which fact about multiples of 888 you use.

Check your answer

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

Need a reminder? The key ideaShowHide

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.

Step 1. Base case. For n=1n = 1n=1: 32−1=83^2 - 1 = 832−1=8, and 8∣88 \mid 88∣8.

Step 2. Hypothesis. Assume 8∣32k−18 \mid 3^{2k} - 18∣32k−1.

Step 3. The step. 32k+2−1=9×32k−9+9−1=9(32k−1)+83^{2k + 2} - 1 = 9 \times 3^{2k} - 9 + 9 - 1 = 9(3^{2k} - 1) + 832k+2−1=9×32k−9+9−1=9(32k−1)+8. The first part is 999 times a multiple of 888, and 888 is a multiple of 888. The sum of two multiples of 888 is a multiple of 888.

Step 4. Conclusion. By induction, 8∣32n−18 \mid 3^{2n} - 18∣32n−1 for every n≥1n \ge 1n≥1.

Step 5. Part (b). 36−1=7283^6 - 1 = 72836−1=728, and 728÷8=91728 \div 8 = 91728÷8=91.

Step 6. Part (c). 32n+1=3(32n−1)+33^{2n + 1} = 3(3^{2n} - 1) + 332n+1=3(32n−1)+3. The first part is a multiple of 888, so the pointer stops 333 marks past mark 000, at mark 333.

Answer: (b) 919191; (c) mark 333.

Log in to save this for later
← All Problems
← A puzzle book asks for the value of T(n) = 1 × 1! …A number puzzle says: for every whole number n ≥ 0, the number 11^(n + 2) + 12^(2n + 1) is a… →
More onMathematical Induction

Discussion (0)

Log in to join the discussion.

Loading…

More on this topic

  1. Let Pn = 1/2 × 3/4 × 5/6 × … × (2n - 1)/2n…Advanced
  2. A designer draws n straight lines across a large sheet, no two parallel and no three through one…Advanced
  3. An L-shaped piece covers three squares: two side by side and one more next to one of them…Advanced
  4. A student puts n points on a circle and joins every pair by a straight chord, choosing the points…Hard
  5. Read this false proof carefully. Claim. For every n ≥ 2: if n lines in the plane are such that no…Advanced
All problems on this topic →

To prove d∣f(n)d \mid f(n)d∣f(n): check d∣f(n0)d \mid f(n_0)d∣f(n0​), assume d∣f(k)d \mid f(k)d∣f(k), and write f(k+1)=c f(k)+(a clear multiple of d)f(k + 1) = c\,f(k) + (\text{a clear multiple of } d)f(k+1)=cf(k)+(a clear multiple of d). Multiplying f(k)f(k)f(k) by the base of the power and subtracting usually shows the form.