A function f on [a, b] is called a step function if there exists a partition P = {a = u0 < u1 < ··· < cm = b} of [a, b]
1 answer:
You might be interested in
means to say that for any given , we can find
such that anytime
(i.e. the whenever
is "close enough" to 5), we can guarantee that
(i.e. the value of
is "close enough" to the limit value).
What we want to end up with is
Dividing both sides by 3 gives
which suggests is a sufficient threshold.
The proof itself is essentially the reverse of this analysis: Let be given. Then if
and so the limit is 7. QED
Step-by-step explanation:
yes i ccsan help but i dont know what your question is
the answer is 2.66 (continuous sixes)
is this what the question is?
