Prime calculator sum(1.0002^n/n, 1, 20000)

[Gil]

Differences of times might be substantial — on the same "device/model" —
according to how you calculate:
- with integer limits or with no-integer (i. e. limits with dot);
- with build-in summation (Greek S) or the loop For... Next.

With Emu48 Android Application
on my phone Samsung galaxy S6,
I got the following results:

7.7" with points after 0., 1. and 2000.:
\<< 0. 1. 20000.
FOR i 1.0002 i ^ i / +
NEXT
\>>

22.8" without points after 0, 1 and 20000:
\<< 0 1 20000
FOR i 1.0002 i ^ i / +
NEXT
\>>

9.1" without points, i. e. limits like integers,
but mandatory with -105 SF!
\<< '\GS(n=1,20000,1.0002^n/n)' -105. SF EVAL
\>>

8.9" with points already included after 1. and 20000.:
\<< '\GS(n=1.,20000.,1.0002^n/n)' EVAL
\>>

Conclusion:
The self-made program is the fastest... providing you do not
forget to put dots to the limits (no-integers).

Regards, [/align]
Gil