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

-- 
                                                          - Warp

Post a reply to this message