View Single Post
Old 2008-08-14, 07:02   #1
Peter Hackman
 
Peter Hackman's Avatar
 
Oct 2007
linköping, sweden

22×5 Posts
Default lots of large primes

I going over my QS hobby programs I've been running two versions, one with multipliers, one without.

Typically my runs have been on 50-digit numbers (as I've indicated elsewhere my Python programs are very slow), sieving interval [-10**5, 10**5], factorbase 3000, lowest prime sieved on 37, large prime bound 200*pmax. I've sieved until smooths+0.07*partials exceeds 0.96*length of factor base. This is safe, not to say pessimistic, as I usually get
something like 100-200 relations.

However, in some cases, especially when the multiplier is small, I get an enormous amount of redundance, slowing things down considerably. In other words, in these cases I get many more matches
than expected.
I suppose I could modify my program
to deal with this phenomenon. Just curious whether there is some simple explanation for it.

Last fiddled with by Peter Hackman on 2008-08-14 at 07:36
Peter Hackman is offline   Reply With Quote