- #1
Klaus_Hoffmann
- 86
- 1
recently i saw on a book (Apostol Analytic Number theory if i am not wrong) the prime calculating expression [tex] \sum_{p} 10^{-p}=S [/tex]
where the sum was extended to all the prime numbers, if i am right
[tex] S=0.2003000500007.... [/tex]
so knowing the value of 'S' you could get the primes, hence here is my questions if we knew an 'accelerating' process for the series above in a similar way to Euler transformation or Euler-Laurin sum formula, could we get an efficient algorithm to calculate primes?.
where the sum was extended to all the prime numbers, if i am right
[tex] S=0.2003000500007.... [/tex]
so knowing the value of 'S' you could get the primes, hence here is my questions if we knew an 'accelerating' process for the series above in a similar way to Euler transformation or Euler-Laurin sum formula, could we get an efficient algorithm to calculate primes?.