Loading ...
Sorry, an error occurred while loading the content.

[PrimeNumbers] Sieve for the primes

Expand Messages
  • Vinícius Botelho
    Hi I have developed a Sieve for the prime numbers that, with the primes up to p(n-1), gives p(n), p(n+1), and pi(2*p(n-1)). The link for the paper is:
    Message 1 of 3 , Jun 21, 2008
    • 0 Attachment
      Hi

      I have developed a Sieve for the prime numbers that, with the primes up to
      p(n-1), gives p(n), p(n+1), and pi(2*p(n-1)).



      The link for the paper is:

      HYPERLINK
      "http://www.viniciusobotelho.com.br/primes.pdf"http://www.viniciusobotelho.c
      om.br/primes.pdf



      I would be pleased of receiving a feedback from anyone interested in reading
      it.



      Thanks

      Vinícius


      No virus found in this incoming message.
      Checked by AVG.
      Version: 7.5.524 / Virus Database: 270.4.1/1510 - Release Date: 19/6/2008
      15:21



      No virus found in this outgoing message.
      Checked by AVG.
      Version: 7.5.524 / Virus Database: 270.4.1/1512 - Release Date: 21/6/2008
      09:27



      [Non-text portions of this message have been removed]
    Your message has been successfully submitted and would be delivered to recipients shortly.