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

RE: [PrimeNumbers] anything unique about this?

Expand Messages
  • Bhupinder Singh Anand
    On 26 March 2007 07:50 AM, Wes wrote in primenumbers: W Are methods to do this well-known in number theory ...
    Message 1 of 2 , Mar 25, 2007
    • 0 Attachment
      On 26 March 2007 07:50 AM, Wes wrote in primenumbers:

      W>> Are methods to do this well-known in number theory ... <<W

      Wes
      ====
      Yes, of course. There are a number of ways - generally, based on
      Eratosthenes sieve - of identifying / generating the primes along the lines
      you describe.

      See, for instance: "Three Theorems on modular sieves that suggest the Prime
      Difference is O(Number of primes < (p(n)^1/2))"

      http://alixcomsi.com/Three_Theorems.htm
      http://alixcomsi.com/Three_Theorems.pdf

      and

      http://alixcomsi.com/Prime_number_generator.htm

      Regards,

      Bhup
    Your message has been successfully submitted and would be delivered to recipients shortly.