Prime calculator sum(1.0002^n/n, 1, 20000)
|
12-28-2020, 02:03 PM
Post: #18
|
|||
|
|||
RE: Prime calculator sum(1.0002^n/n, 1, 20000)
If you wanted one sum rather than two (1-10000 plus 10001-20000) you could use
Sum(1.0002^n/n + 1.0002^(10000+n)/(10000+n),n,1,20000/2) Which only has 10 000 terms. But it is no faster than the other expression. (the formula I tried earlier was incorrect) Stephen Lewkowicz (G1CMZ) https://my.numworks.com/python/steveg1cmz |
|||
« Next Oldest | Next Newest »
|
User(s) browsing this thread: 1 Guest(s)