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 the count is thousand. Each hour the count triples, and then thousand are removed for testing. So and , in thousands.
Check (d) with the hour before it, so that you are sure it is the first.
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.
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). , , . Subtracting gives , powers of . We guess .
Step 2. Base case. . True.
Step 3. The step. Assume . Then . This is the formula with . By induction it holds for every .
Step 4. Part (c). thousand.
Step 5. Part (d). We need . Since and , the first such has , so . Check: and .
Answer: thousand, and the count first passes thousand at hour .
Log in to join the discussion.
Loading…