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
  • Earth and Environmental Science
  • 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 culture of cells triples every hour. At the end of each hour a technician removes 4 thousand…
AdvancedMathematicsHigh School (11–12)Pigeonhole Principle, Recursion and Graph TheoryNumericalproofOlympiad

A culture of cells triples every hour. At the end of each hour a technician removes 4 thousand…

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 culture of cells triples every hour. At the end of each hour a technician removes 444 thousand cells for tests. At the start there are 555 thousand cells. Let ana_nan​ be the number of cells, in thousands, just after the nnnth removal, with a0=5a_0 = 5a0​=5.

Write the recurrence for ana_nan​ and find its fixed point. Solve the recurrence, prove your formula by induction, and find the number of cells just after the 444th removal. What would happen if the culture started with 222 thousand cells?

Check your answer

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

thousand cells
thousand cells
Need a reminder? The key ideaShowHide

For an=pan−1+qan−2a_n = pa_{n-1} + qa_{n-2}an​=pan−1​+qan−2​ solve x2=px+qx^2 = px + qx2=px+q. Two different roots give an=Arn+Bsna_n = Ar^n + Bs^nan​=Arn+Bsn; a double root gives an=(A+Bn)rna_n = (A + Bn)r^nan​=(A+Bn)rn. For an=can−1+da_n = ca_{n-1} + dan​=can−1​+d use the fixed point L=cL+dL = cL + dL=cL+d.

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. The recurrence. an=3an−1−4a_n = 3a_{n-1} - 4an​=3an−1​−4, with a0=5a_0 = 5a0​=5 (in thousands of cells).

Step 2. The fixed point. L=3L−4L = 3L - 4L=3L−4 gives L=2L = 2L=2 thousand cells.

Step 3. Solve. an−2=3(an−1−2)a_n - 2 = 3(a_{n-1} - 2)an​−2=3(an−1​−2), so an−2=3n(5−2)a_n - 2 = 3^n(5 - 2)an​−2=3n(5−2) and an=2+3n+1a_n = 2 + 3^{n+1}an​=2+3n+1.

Step 4. Proof by induction. For n=0n = 0n=0: 2+3=52 + 3 = 52+3=5. If an−1=2+3na_{n-1} = 2 + 3^nan−1​=2+3n, then an=3(2+3n)−4=2+3n+1a_n = 3(2 + 3^n) - 4 = 2 + 3^{n+1}an​=3(2+3n)−4=2+3n+1.

Step 5. After four removals. a4=2+35=245a_4 = 2 + 3^5 = 245a4​=2+35=245 thousand cells.

What if? Starting at the fixed point, a0=2a_0 = 2a0​=2, gives 3×2−4=23 \times 2 - 4 = 23×2−4=2 every hour: the culture stays at 222 thousand cells.

Answer: fixed point 222 thousand cells, and 245245245 thousand cells after the 444th removal. Proof complete.

Log in to save this for later
← All Problems
← A sequence has a₀ = 1 and a₁ = 6, and an = 6a_(n-1) - 9a_(n-2) for n ≥ 2…The golden ratio is φ = (1 + √5)/2, and its partner is ψ = (1 - √5)/2… →
More onPigeonhole Principle, Recursion and Graph Theory

Discussion (0)

Log in to join the discussion.

Loading…

Learn it in

  1. Solving linear recurrencesRecurrences and Counting by Recursion

More on this topic

  1. The 15 edges of K₆ are coloured red or blue…Advanced
  2. Three houses each need a path to each of three wells, nine paths in all, drawn on flat ground…Advanced
  3. A connected planar graph with 10 vertices is drawn without crossings, and every face of the…Hard
  4. The complete bipartite graph K_(m,n) joins each of m left vertices to each of n right vertices…
Advanced
  • A river town has five land areas, A, B, C, D and E, joined by ten bridges…Hard
  • All problems on this topic →