2.16 Gz processor is not that bad. Took 9.768 s. to find [URL="http://www.factordb.com/index.php?query=3700285118102269753950605425644381515156552109177149990508568686380478785925030972787629040171540198591399550712781362020250744530300097831999401118807452235047937855782833523781743750014480242278433151364478487527648387307701272135612223958783016935577221308560978466029225563705329289068306330703575613788583084836283597023058224907708621065737335464328481470262472065119291450206715363115991092867747319137044978932526697019714970637155674431143632103537290847892413461313304919205159470446588638964526390235939469977335746488705035571864197467399617060717071078870251970149081572430313453570520680178339001126882440534227828166124183087834702023419962336853470834070915149503111743148634356613746257625438633958304942259679363631547323164262208376378516773819703352272363606912822925587916328557442122915282768147909487173986883719437206201593229768265143123705396425025427438780231994749388031512547681240575165914460425642880784080720353246038598628682293729864951378795773180201092494334542658257485247403752807686396598538385779253350735114240671751112214646797755814297137219523511488968229546125781441102374517810344463869224805231762048759151194569516333339360705724136867089842923945736451969652973851436324345035402845345438747235261090044629295849013450364803796419438336842060749176528105377805720248351007811778521997199000246191090483781212774485595661088282738585857859288106978707784994248533919983702985319001960948541023153856839981928215696376835922550583066534425565697703064752568817594173754278908696554608500932422904802813981453818653267&use=n&n=1&VP=on&VC=on&EV=on&OD=on&PR=on&FF=on&PRP=on&CF=on&U=on&C=on&perpage=200&format=1"]this prime[/URL], using the same methods I can use for larger PRPs. Now double each prp's digits 7 times, (4x times as much for doubled candidates) is about 1 day, 20 h. 27 min. Seems right?

Joining the party for this random and otherwise uninteresting PRP:

[code]
time perl -Mntheory=:all -nE 'chomp; say length($_); say is_bpsw_prime($_); say is_frobenius_pseudoprime($_); say is_frobenius_khashin_pseudoprime($_); say is_frobenius_underwood_pseudoprime($_);' ~/Downloads/prp_6056.txt
6056
1
1
1
1

real 0m30.460s
user 0m30.425s
sys 0m0.012s
[/code]

So it passes BPSW (strong pseudoprime base 2 + extra strong Lucas), a Frobenius test, Khashin's Frobenius-type test, and Underwood's Frobenius-type test. The F-U test here uses GMP and takes less than 6 seconds. At 200k these should work fine, but Paul's gwnum version will be quite a bit faster.

On my machine (X5550 2.67GHz), PFGW took 4x longer for a 2x larger input. ~95s at 50k digits, ~390s at 100k digits. No AVX.

The time in the paragraph above is purely the time taken for a given composite candidate, and does not take into account how the expected number of tests until a PRP is found will go up as the size goes up.

But does it have AVX? If you are running Linux on it you can type [c]cat /proc/cpuinfo[/c] to see. Under windows you have go clickety click somewhere :smile:

[QUOTE=PawnProver44;434305]2.16 Gz processor is not that bad. Took 9.768 s. to find .... using the same methods I can use for larger PRPs. Now double each prp's digits 7 times, (4x times as much for doubled candidates) is about 1 day, 20 h. 27 min. Seems right?[/QUOTE]

No! The primes will thin out as they get bigger. You need to multiply by 8 and extrapolating from 10 seconds is useless. :smile:

Command Window (thanks for command, is availible for up to 200k digits?):

---------
C:\Users\Username\Documents> time perl -Mntheory=:all -nE 'chomp; say length($_); say is_bpsw_prime($_); say is_frobenius_pseudoprime($_); say is_frobenius_khashin_pseudoprime($_); say is_frobenius_underwood_pseudoprime($_);' ~/Downloads/prp_6056.txt
The system cannot accept the time entered.
Enter the new time: 440
The system cannot accept the time entered.
Enter the new time: 16666
The system cannot accept the time entered.
Enter the new time: ?
---------

Just sticking to the sieve if that doesn't work.

[c]time[/c] is a Linux command to measure timing. :rolleyes:

Under windows it is used for setting the time!!

Sorry for all delay. I was too busy during this week and I haven't got a chance to download linux version of pfgw, pari/gp and more programs like primo and newpgen...

[QUOTE=danaj;434274]It seems to try to open a file named 46, so I couldn't run it, but now I see it just writes one line at a time.[/QUOTE]

If you are bored and want to see the "program" in action, you can get a copy of that file here: [url]http://www.mersenneforum.org/showthread.php?t=21252[/url]

Since there are 49 (so far) files to choose from, we probably should use a command line argument for the file name instead of hard coding it.

:mike:

For Windows you need to take into account how even today the DOS command shell is basically 1970's CP/M.
[code]
C:\>perl -Mntheory=:all -nE "chomp; say length($_); say is_bpsw_prime($_); say is_frobenius_pseudoprime($_); say is_frobenius_khashin_pseudoprime($_); say is_frobenius_underwood_pseudoprime($_);" prp_6056.txt
[/code]
You have to write your own little .bat script for timing if you want (use your favorite search engine).

It should work on 200k inputs. I just ran it on a Windows laptop with the 50k digit PRP "10^49999 + 91701". It isn't fast -- ~2 hours for all four tests.

Re Xyzzy's file, I was seeing those odd-looking forms on the PRPtop site when I tried the number above. Now I know where they came from!

So here is what I will actually do:

1. Use Paul's pari/gp script for sieve and random number gen. + PFGW's prp test for all remaining candidates

2. Use Dana's perl/netheory script to preform stronger tests.

3. From calculations of 8x as much time for 2x the digits, would take 5.3333 days for my current aim.

4. I am thinking about seeing weather Dana's perl script hold 300k digits, 400k digits, etc. so I know what limits are placed.

5. Or use Xyzzy's Script (for sieving)

6. Laziest, but less efficient is pfgw's nextprime.

If I get pfgw, pari/gp, etc...... set up by tomorrow, I will probably have 200k digit prp to show you soon. :smile:

Do you have access to a Linux machine?

If not, there are many free possibilities.