![]() |
|
|
#1 |
|
Mar 2013
216 Posts |
Dear prime hunters
I'm searching for generalized primorials (k*pn#+-1) but for seiveing I have a problem. Since NewPGen doesn't allow me to go further than 119K, I'm forced to use PFGW -f for sieving which is much slower than NewPGen. NewPGen says: "The maximum value for a primorial is 274579# - which has got about 119248 decimal digits" What's your suggestion on this? Is the source of NewPGen available to modify it? Or does exit any other powerful sieve tool specialized for primorial? Thanks |
|
|
|
|
|
#2 |
|
Just call me Henry
"David"
Sep 2007
Cambridge (GMT/BST)
23×3×5×72 Posts |
The source is at http://jpenne.free.fr/NewPGen/
|
|
|
|
|
|
#3 |
|
Feb 2006
Denmark
2·5·23 Posts |
What are you varying? If pn# is fixed then I have an unpublished program APTreeSieve which can sieve any arithmetic progression up to at least 700000 digits. For k*274579#+-1 it's around 10 times as fast as NewPGen.
It's a command-line program with a poor user interface. |
|
|
|
|
|
#4 | |
|
Mar 2013
28 Posts |
Quote:
I got a hand on that and could compile it but because of assembly implementations in the code, it's not easy to raise the limits ...
|
|
|
|
|
|
|
#5 |
|
Dec 2011
After milion nines:)
5×172 Posts |
Why you compile ( do it hard way) , you can easly ask Jens K Andersen to send you unpublished program APTreeSieve
Last fiddled with by pepi37 on 2013-03-23 at 10:43 |
|
|
|
![]() |
Similar Threads
|
||||
| Thread | Thread Starter | Forum | Replies | Last Post |
| Largest Known Primorial | a1call | Miscellaneous Math | 11 | 2016-12-14 21:35 |
| Primorial calculation | FreakyPotato | Programming | 7 | 2015-02-06 10:33 |
| primorial primes | jasong | Math | 1 | 2006-08-12 01:38 |
| Primorial puzzle | Citrix | Puzzles | 3 | 2006-03-07 15:07 |
| Primorial question | Dougy | Math | 2 | 2005-07-28 13:13 |