Re: an interesting sum

amzoti wrote:
[snip]

Can you please provide an algorithm for finding Prime[k] for k ranging
from 1 to infinity over that sum?

If we had an algorithm for finding prime[k] for all k, we'd be a very happy
bunch of people, here, believe me :-)

I don't know how David did it, but I am guessing that he used an approximation
of the original function with k running from 1 to some large value, say 1000 or
something.

How did you find your value of S(4)? (Given that we got the same
result for it.)
--
I.N. Galidakis


.

Relevant Pages

  • Re: an interesting sum
    ... from 1 to infinity over that sum? ... If we had an algorithm for finding primefor all k, ... bunch of people, here, believe me :-) ... The fact that a believer is happier than a sceptic is no more to the ...
    (sci.math)
  • Re: an interesting sum
    ... from 1 to infinity over that sum? ... If we had an algorithm for finding primefor all k, ... -10 points for nitpicking on something which you knew I knew, ...
    (sci.math)
  • Re: Chex Wat: Pi is "random" and "not predictable"?
    ... case of detecting designed living beings as separate ... such an algorithm", ... the infinity of "correct" sequence ... make 100 correct predictions in a row without any ...
    (talk.origins)
  • Re: Different Kinds of Infinity
    ... hypothesis that it is in fact the correct algorithm and that it has ... successful prediction. ... other substrings within the normal number that match that finite sequence. ... the infinity of "correct" sequence ...
    (talk.origins)
  • Re: Is there a polynomial algorithm for that problem?
    ... The sum over all n numbers is negative. ... Unfortunately that algorithm does not scale. ... An instance of 3-Partition consists of a list of 3m positive integers ... list can be partitioned into m lists of size 3, ...
    (sci.math)