Discover the answers to your questions at Westonci.ca, where experts share their knowledge and insights with you. Get immediate and reliable solutions to your questions from a community of experienced experts on our Q&A platform. Join our Q&A platform to connect with experts dedicated to providing accurate answers to your questions in various fields.
Sagot :
Answers are in bold
S1 = 1
S2 = 0.5
S3 = 0.6667
S4 = 0.625
S5 = 0.6333
=========================================================
Explanation:
Let [tex]f(n) = \frac{(-1)^{n+1}}{n!}[/tex]
The summation given to us represents the following
[tex]\displaystyle \sum_{n=1}^{\infty} \frac{(-1)^{n+1}}{n!}=\sum_{n=1}^{\infty} f(n)\\\\\\\displaystyle \sum_{n=1}^{\infty} \frac{(-1)^{n+1}}{n!}=f(1) + f(2)+f(3)+\ldots\\\\[/tex]
There are infinitely many terms to be added.
-------------------
The partial sums only care about adding a finite amount of terms.
The partial sum [tex]S_1[/tex] is the sum of the first term and nothing else. Technically it's not really a sum because it doesn't have any other thing to add to. So we simply say [tex]S_1 = f(1) = 1[/tex]
I'm skipping the steps to compute f(1) since you already have done so.
-------------------
The second partial sum is when things get a bit more interesting.
We add the first two terms.
[tex]S_2 = f(1)+f(2)\\\\S_2 = 1+(-\frac{1}{2})\\\\S_2 = \frac{1}{2}\\\\S_2 = 0.5\\\\\\[/tex]
The scratch work for computing f(2) is shown in the diagram below.
-------------------
We do the same type of steps for the third partial sum.
[tex]S_3 = f(1)+f(2)+f(3)\\\\S_3 = 1+(-\frac{1}{2})+\frac{1}{6}\\\\S_3 = \frac{2}{3}\\\\S_3 \approx 0.6667\\\\\\[/tex]
The scratch work for computing f(3) is shown in the diagram below.
-------------------
Now add the first four terms to get the fourth partial sum.
[tex]S_4 = f(1)+f(2)+f(3)+f(4)\\\\S_4 = 1+(-\frac{1}{2})+\frac{1}{6}-\frac{1}{24}\\\\S_4 = \frac{5}{8}\\\\S_4 \approx 0.625\\\\\\[/tex]
As before, the scratch work for f(4) is shown below.
I'm sure you can notice by now, but the partial sums are recursive. Each new partial sum builds upon what is already added up so far.
This means something like [tex]S_3 = S_2 + f(3)[/tex] and [tex]S_4 = S_3 + f(4)[/tex]
In general, [tex]S_{n+1} = S_{n} + f(n+1)[/tex] so you don't have to add up all the first n terms. Simply add the last term to the previous partial sum.
-------------------
Let's use that recursive trick to find [tex]S_5[/tex]
[tex]S_5 = [f(1)+f(2)+f(3)+f(4)]+f(5)\\\\S_5 = S_4 + f(5)\\\\S_5 = \frac{5}{8} + \frac{1}{120}\\\\S_5 = \frac{19}{30}\\\\S_5 \approx 0.6333[/tex]
The scratch work for f(5) is shown below.
Thank you for your visit. We're committed to providing you with the best information available. Return anytime for more. Thanks for using our service. We're always here to provide accurate and up-to-date answers to all your queries. Westonci.ca is your trusted source for answers. Visit us again to find more information on diverse topics.