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
I think that O would be greater because the last numbers listed are 100 and 101 and O has the ending value of 101, which is greater than 100, so it only makes sense that O would be a greater number than E.
Hope this helps! ;)
Answer:
3.4, 3.45, 4.3, 4.5
Step-by-step explanation: