00:01
Okay, so here we have our series.
00:04
We get our sum s is going to be equal to the sum, k going from 1 to infinity of 1 over 2 to the k times k factorial.
00:13
So then basically we're going to end up here is with a geometric series where our first term is 1, and our common ratio r is going to be equal to 1 over 2 times n plus 2.
00:24
So therefore our sum then is going to be equal to a over 1 minus r.
00:32
So that's going to be 1 over 1 minus 1 over 2 times n plus 2, which is going to give us 2 times n plus 2 over 2n plus 4 minus 1.
00:47
So that's going to be equal to 2 times n plus 2 over 2 n plus 3.
00:54
And then from here, we get that s minus s of n is going to be less than 1 over 2 to the n times n plus 1 factorial times n plus 2 over to n plus 3.
01:14
And then we get our upper bound s minus s of n is going to be obtained as we have 0 less than s minus s of n, which is going to be less than 1 over 2 to the n times n plus 1 factorial, times the quantity 2 or n plus 2 divided by 2 n plus 3.
01:40
So then here we want our approximation, the error approximation to be less than 0 .001.
01:48
So therefore we have that s minus s sub n then...