Mueen Nawaz <m.n### [at] ieeeorg> wrote:
> Warp wrote:
> > John VanSickle <evi### [at] hotmailcom> wrote:
> >> For instance, in the problem for summing the 
> >> prime numbers less than one million, I'm not aware of any theorem which 
> >> calculates such a sum for any range without testing each odd number for 
> >> primality and then adding the primes.
> > 
> > http://en.wikipedia.org/wiki/Prime-counting_function

>         I didn't read all of it, but it's not obvious how helpful that would
> be...

  I didn't mean for it to be an answer to the problem but as an interesting
thing to read about the subject.

-- 
                                                          - Warp

Post a reply to this message