Hi,

Imagine I got the following series:

In which u [0,1] (and u REAL)

While and i and n are INTEGERS

The (-1)^something causes an alternating sign, in this way the sum doesn't explode, but seems to end up with a real number between 0 and 1,

adding something big, substracting something even bigger and so on...

(In case the factorial of a negative number is needed, for example in (i- )! this is set to 1.

The problem is that I need to compute the result of this series for large n (say 10000) and my computer breaks down on n! (of couse) for large n.

Is there an easier way to get to a result without computer overflow?

Thanks,

Gerrit