The base case is the claim that
which reduces to
which is true.
Assume that the inequality holds for <em>n</em> = <em>k </em>; that
We want to show if this is true, then the equality also holds for <em>n</em> = <em>k</em> + 1 ; that
By the induction hypothesis,
Now compare this to the upper bound we seek:
because
in turn because
Here is a key that showed up online
To find the answer set up an equation:
Using this set up we can cross our units of pages since they are on opposite side of the proportion, leaving us with the desired units of hours.
Then divide 400 by 65 which will give us our answer: 6.15 or about 6 hours for Jamie to finish her reading.
The answer should be look it up
