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 number puzzle says: for every whole number n ≥ 0, the number 11^(n + 2) + 12^(2n + 1) is a…
AdvancedMathematicsHigh School (11–12)Mathematical InductionNumericalConceptualOlympiadWBJEE
+2 more exams
A-LevelIB
OlympiadA-LevelIB

A number puzzle says: for every whole number n ≥ 0, the number 11^(n + 2) + 12^(2n + 1) is a…

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 number puzzle says: for every whole number n≥0n \ge 0n≥0, the number 11n+2+122n+111^{n + 2} + 12^{2n + 1}11n+2+122n+1 is a multiple of 133133133.

  1. Check the claim for n=0n = 0n=0 and for n=1n = 1n=1, and give the quotient in each case.
  1. Prove the claim by induction on nnn. In the step, let f(k)=11k+2+122k+1f(k) = 11^{k + 2} + 12^{2k + 1}f(k)=11k+2+122k+1. Write f(k+1)f(k + 1)f(k+1) as 11×f(k)11 \times f(k)11×f(k) plus a second part, and show that the second part is a multiple of 133133133.
  1. Why does it help to multiply f(k)f(k)f(k) by 111111 and not by 144144144? Try the other choice and see what the second part becomes.

Notice that 133=144−11133 = 144 - 11133=144−11. This fact is the key to the step.

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. Part (a). For n=0n = 0n=0: 112+12=133=133×111^2 + 12 = 133 = 133 \times 1112+12=133=133×1. For n=1n = 1n=1: 113+123=1331+1728=3059=133×2311^3 + 12^3 = 1331 + 1728 = 3059 = 133 \times 23113+123=1331+1728=3059=133×23.

Step 2. Base case. The case n=0n = 0n=0 above shows 133∣f(0)133 \mid f(0)133∣f(0).

Step 3. Hypothesis. Assume 133∣f(k)133 \mid f(k)133∣f(k).

Step 4. The step. f(k+1)=11k+3+122k+3=11×11k+2+144×122k+1f(k + 1) = 11^{k + 3} + 12^{2k + 3} = 11 \times 11^{k + 2} + 144 \times 12^{2k + 1}f(k+1)=11k+3+122k+3=11×11k+2+144×122k+1. Subtract 11f(k)11f(k)11f(k):

f(k+1)−11f(k)=(144−11)×122k+1=133×122k+1.\displaystyle f(k + 1) - 11 f(k) = (144 - 11) \times 12^{2k + 1} = 133 \times 12^{2k + 1}.f(k+1)−11f(k)=(144−11)×122k+1=133×122k+1.

So f(k+1)=11f(k)+133×122k+1f(k + 1) = 11 f(k) + 133 \times 12^{2k + 1}f(k+1)=11f(k)+133×122k+1, a sum of two multiples of 133133133.

Step 5. Conclusion. By induction, 133∣f(n)133 \mid f(n)133∣f(n) for every n≥0n \ge 0n≥0.

Step 6. Part (c). With 144144144 the second part is (11−144)×11k+2=−133×11k+2(11 - 144) \times 11^{k + 2} = -133 \times 11^{k + 2}(11−144)×11k+2=−133×11k+2. That works too. Either choice leaves 144−11144 - 11144−11 as a factor.

Answer: the quotients are 111 and 232323, and 133133133 divides every f(n)f(n)f(n).

Log in to save this for later
← All Problems
← A clock face has 8 marks, numbered 0 to 7…Let f(n) = n⁵ - n for whole numbers n ≥ 1… →
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.