Quote:
Originally Posted by tasos Hello to everyone,
Could somebody please tell me how do we solve exercises like the one I describe below: = e + O(1/n)
Thanks a lot,
Tasos |
Are you sure you put the parentheses at the right place? Because this is correct, but not optimal, as you shall see:
I'll apply usual properties of the "big O" notation. If you don't know them, just ask, the proofs are very short.
First you have

, and it is more usual to write it this way.
Then

.
I used the following expansion of the exponential at 0:

when

tends to 0, composed with the sequence

which tends to 0.
Now,

, hence the previous big O can be replaced by

, and this is what you need.
Let us now suppose that the question was

, which seems more plausible to me.
Then we would have:

(as before, the second big O can be included in the first one), and by the same computation as above we conclude

.
ps: about the way to write symbols, there's a section in the forum related to "LaTeX", and this is where you should look for help about this.