10649Re: primes close to 2^(2^n) for n = 11..14
- Jan 4, 2003--- In email@example.com, Phil Carmody <thefatphil@y...>
> --- Carl Devore <devore@m...> wrote:That is a pretty slow way to do it. Might I suggest using CPAPSieve
>> On Fri, 3 Jan 2003, Phil Carmody wrote:
>>>I don't know any list which goes up to such high powers of 2.
>>>Heheh, 2^(2^9) I could give you a vast number of examples for.
>>I found a list for the largest n-bit prime for n up to 400. It
>>should be feasible, and useful I believe, to extend this up
>>n~2^14. Even a list of any n-bit prime for each n would be useful.
>This is a job for script-mode PFGW. Anyone care to write a script
>that will generate 10 PRPs above and below each exponent?
>(You only need script mode to get it to stop after finding 10, you
>could> simply get it to to a fixed size band using ordinary ABC2
to presieve. It operates as fast (or nearly as fast) as NewPGen.
Once the sieved file is generated (in ABC or ABCD format, not ABC2)
Then, once the well factored data is built, use PFGW to process the
file. Stop (manually) when 10 (or more) primes have been found.
This method should allow a much faster search than using the ABC2
format and using PFGW to trial factor each candidate individually.
If anyone wants to do this, I have a newer version of CPAPSieve that
can do b^n-K as well as b^n+K factoring (and a program called reverse
that reverses the -maxK to -minK file so that the number closer to
k==0 are tested first).
If anyone wants to do this, contact me off list. I might be hard to
get ahold of this weekend (will be out hunting), but I can get you
a newer version of CPAPSieve (the version on-line will work for the
b^n+K testing), and a version of reverse.exe (simple text file line
PS, here are some results (these are ONLY prp-3 tested):
Tested up to 2^8192-43073, but I am out of time and have to go.
Options for CPAPSieve would be:
cpapsieve -b=2 -n=16384 -K=-1 -k=-250000 -O=14m -L
cpapsieve -b=2 -n=16384 -k=1 -K=250000 -O=14p -L
then do reverse 14m.in to get the minuses into n-1 to n-250000 order
then use WinPFGW to test 14p.in and 14m.in files until enough PRPs
are found. A range of 250000 should be enough for 2^(2^14)+-k range.
This size would need increased as the size of the numbers increased
(or if searching for more PRP's)
- << Previous post in topic Next post in topic >>