Re: Need help with infinite series



> >
> >The summation of 10^9 terms is 0.604882832034161
> >
> >So, 0.604914454810747 < s < 0.604882832034161
> >
> >The average is 0.604898643422454
>
> The expected error in the sum of 10^9 terms would be
> the last 4 or 5
> digits. Your computation seems to be off in the last
> 4 places.
>
> Using the asymptotic expansion from another thread in
> this topic, we
> can derive the asymptotic expansion for the
> alternating series:
>
> 2n
> --- k-1 1
> > (-1) -------
> --- sqrt(k)
> k=1
>
> 1 1
> 1 1 5
> ~ (1 - sqrt(2)) zeta(1/2) + sqrt(2n) ( - -- +
> -- + ----- - -------
> 4n
> 4n 32n^2
> 4n 32n^2 2048n^4
>
> 63 7293
> + -------- - ---------- + ... )
> 65536n^6 8388608n^8
>
> We also have both of the following:
>
> 1 1
> -------- = sqrt(2n) ( -- )
> sqrt(2n) 2n
>
> 1 1 1 3 5
> ---------- ~ sqrt(2n) ( -- - ---- + ----- -
> -- - ------ + ... )
> sqrt(2n+1) 2n 8n^2 64n^3
> 4n^3 256n^4
>
> Thus, if we average two adjacent partial sums, either
> 2n-1 and 2n or
> 2n and 2n+1, the error is about
>
> 1 -3/2
> - (2n)
> 8
>
> which is about 4e-15 when 2n = 10^9. So your answer,
> to the number of
> decimal places you have, should be off in only the
> last place, but it
> is off in the last 4.
>
> This means that the major source of error in your
> computation is the
> rounding error coming from adding 10^9 terms.

10^9 terms was determined using simple loop for summations. Is there any way to increase accuracy of soft wares like MATLAP for such cases
.



Relevant Pages

  • every number has its own significance.....
    ... 18 is the only number that is twice the sum of its digits. ... 21 is the smallest number of distinct squares needed to tile a square. ... 26 is the only number to be directly between a square and a cube. ... 27 is the largest number that is the sum of the digits of its cube. ...
    (sci.crypt)
  • Re: six six seven
    ... It is also equal to the sum of its digits plus the cubes of its digits: ... 16661 is the first beastly palindromic prime, ... (Also, note that from the two powers, 47 and 51, we get ...
    (alt.sports.football.pro.ne-patriots)
  • [SUMMARY] Checking Credit Cards (#122)
    ... to see how people approached the Luhn algorithm implementation. ... # check specified conditions to determine the type of card ... # sum the resulting digits, mod with ten, check against 0 ... simple sum of the digits and the final modulo test to determine validity. ...
    (comp.lang.ruby)
  • Re: standard deviation, but without the mean
    ... Suppose Xsum is the sum of the the first n numbes and that X2 is ... Just keep track if X2 and Xsum as you go. ... Actually this is not a correct algorithm, ... the error in the least 9 digits.. ...
    (sci.stat.math)
  • Re: Is continuum completely filled up?
    ... This is difinition of the sum of Cauchy sequence. ... The "infinite sum" is not actually a sum. ... I can compare infinite decimals. ... which share those initial digits. ...
    (sci.math)