View Single Post
Old 2013-03-27, 17:27   #5
Puzzle-Peter
 
Puzzle-Peter's Avatar
 
Jun 2009

13·53 Posts
Default

Quote:
Originally Posted by Mini-Geek View Post
You could vary n, you just need to search a large k range. Consider if you were to search n=1.0M-1.1M. You might lose some sieving efficiency from not having one fixed n, but you'd gain some efficiency by being able to search smaller k's. I don't know which effect is larger.
Might be worth a try. In fact I have already done this for quad-hunting, without taking timings though. But would a bunch of 1.0M to 1.1M primes be much better than bunch of 1.0M primes? How can primes be "good" or "bad" anyway?
Puzzle-Peter is offline   Reply With Quote