Summasjon av rekke
Posted: 18/03-2010 01:12
Hallo.
Oppgaveteksten lyder:
"Find the best upper bound you can for the error [tex]s-s_n[/tex] encountered if the partial sum [tex]s_n[/tex] is used to approximate the sum s of [tex]\sum_{n=1}^{\infty} \frac{1}{2^k k!}[/tex]. How many terms do you need to be sure that the approximation has error less than 0.001?"
Jeg skjønner ikke heeelt hva jeg skal gjøre, og heller ikke hvor jeg skal starte.
Oppgaveteksten lyder:
"Find the best upper bound you can for the error [tex]s-s_n[/tex] encountered if the partial sum [tex]s_n[/tex] is used to approximate the sum s of [tex]\sum_{n=1}^{\infty} \frac{1}{2^k k!}[/tex]. How many terms do you need to be sure that the approximation has error less than 0.001?"
Jeg skjønner ikke heeelt hva jeg skal gjøre, og heller ikke hvor jeg skal starte.