Re: an interesting sum

"I.N. Galidakis" <morpheus@xxxxxxxxxxxx> writes:
Phil Carmody wrote:
"I.N. Galidakis" <morpheus@xxxxxxxxxxxx> writes:
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 :-)

But they'd be either senile or on drugs.

We have dozens of algorithms hat find prime[k] for all k. However,
they're simply not interesting at all as they aren't efficient.
(Many of them are ludicrously inefficient - quadruply nested
sums, for example)

-10 points for nitpicking on something which you knew I knew, yet felt the need
to nitpick.

As far as I can remember, I have seen no evidence that you know
what you are talking about in this regard, and have concrete
evidence, the above, that you spout nonsense. So I certainly
didn't "know you knew" anything. I still don't.

So -10 is far better than the -oo to you for being just plain wrong.

Phil
--
The fact that a believer is happier than a sceptic is no more to the
point than the fact that a drunken man is happier than a sober one.
The happiness of credulity is a cheap and dangerous quality.
-- George Bernard Shaw (1856-1950), Preface to Androcles and the Lion
.

Relevant Pages

  • 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, ... As far as I can remember, I have seen no evidence that you know ...
    (sci.math)
  • 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: 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)
  • Re: Choose k random lines from file
    ... > What, for the algorithm shown above, or for any algorithm? ... Yes, that is an unbiased generator, but I had thought ... >>give less of a bias using an extra float or double ... >>distribution for the sum. ...
    (comp.programming)
  • Re: requirements for systems that learn
    ... sort of neural network program running on a normal ... People that test far on the N end of the scale, ... evidence that I've never seen. ... not until you have the next algorithm to test - and you can't find ...
    (comp.ai.philosophy)