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

Re: Crude sieve in pari

Expand Messages
  • andrew_j_walker
    ... optimisations. ... I ve just uploaded the file fctsv.c to the main file area. As written and as I tested it, it sieves in the range n=1-20000. It also
    Message 1 of 4 , Jun 23, 2002
    • 0 Attachment
      --- In primenumbers@y..., Phil Carmody <thefatphil@y...> wrote:
      >
      > You could upload the source to the files area, as I'm certainly
      > prepared to look at the code and look for simple micro-
      optimisations.
      > The speed sounds quite reasonable already though, maybe you're not
      > sieving as wide a range as I was with factorials (and speed is
      > O(width^(1-epsilon))).
      >

      I've just uploaded the file fctsv.c to the main file area. As written
      and as I tested it, it sieves in the range n=1-20000. It also still
      strikes out some prime values of n!^2+1 for n<10 when p=n!^2+1,
      I'll just start from n=10 in pfgw!

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