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 bacteria count in a culture follows a simple model…
HardMathematicsHigh School (11–12)Mathematical InductionNumericalConceptualOlympiadWBJEE
+2 more exams
A-LevelIB
OlympiadA-LevelIB

A bacteria count in a culture follows a simple model…

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 bacteria count in a culture follows a simple model. At the start of hour 111 the count is 222 thousand. Each hour the count triples, and then 222 thousand are removed for testing. So a1=2a_1 = 2a1​=2 and an+1=3an−2a_{n + 1} = 3a_n - 2an+1​=3an​−2, in thousands.

  1. Work out a2a_2a2​, a3a_3a3​ and a4a_4a4​. Guess a closed formula for ana_nan​.
  1. Prove your formula by induction.
  1. Find a8a_8a8​.
  1. Find the first hour nnn at which the count is more than 100001000010000 thousand.

Check (d) with the hour before it, so that you are sure it is the first.

Check your answer

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

thousand
Need a reminder? The key ideaShowHide

For a recursion, list terms, guess a closed formula and prove it by induction. A rule that uses two earlier terms needs two base cases. To show a sequence is increasing and bounded, prove each fact by induction.

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). a2=6−2=4a_2 = 6 - 2 = 4a2​=6−2=4, a3=12−2=10a_3 = 12 - 2 = 10a3​=12−2=10, a4=30−2=28a_4 = 30 - 2 = 28a4​=30−2=28. Subtracting 111 gives 1,3,9,271, 3, 9, 271,3,9,27, powers of 333. We guess an=3n−1+1a_n = 3^{n - 1} + 1an​=3n−1+1.

Step 2. Base case. a1=30+1=2a_1 = 3^0 + 1 = 2a1​=30+1=2. True.

Step 3. The step. Assume ak=3k−1+1a_k = 3^{k - 1} + 1ak​=3k−1+1. Then ak+1=3(3k−1+1)−2=3k+1a_{k + 1} = 3(3^{k - 1} + 1) - 2 = 3^k + 1ak+1​=3(3k−1+1)−2=3k+1. This is the formula with n=k+1n = k + 1n=k+1. By induction it holds for every n≥1n \ge 1n≥1.

Step 4. Part (c). a8=37+1=2188a_8 = 3^7 + 1 = 2188a8​=37+1=2188 thousand.

Step 5. Part (d). We need 3n−1>99993^{n - 1} > 99993n−1>9999. Since 38=65613^8 = 656138=6561 and 39=196833^9 = 1968339=19683, the first such nnn has n−1=9n - 1 = 9n−1=9, so n=10n = 10n=10. Check: a9=6562<10000a_9 = 6562 < 10000a9​=6562<10000 and a10=19684>10000a_{10} = 19684 > 10000a10​=19684>10000.

Answer: a8=2188a_8 = 2188a8​=2188 thousand, and the count first passes 100001000010000 thousand at hour 101010.

Log in to save this for later
← All Problems
← A pile of n stones sits on a table. A player splits any pile with more than one stone into two…Squares with sides 1, 1, 2, 3, 5, 8, … (the Fibonacci numbers F₁, F₂, …) are placed one after… →
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 →