20160518, 15:52  #78 
"NOT A TROLL"
Mar 2016
California
197 Posts 
2.16 Gz processor is not that bad. Took 9.768 s. to find this prime, 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?
Last fiddled with by PawnProver44 on 20160518 at 15:59 
20160518, 15:58  #79 
"Dana Jacobsen"
Feb 2011
Bangkok, TH
3^{2}·101 Posts 
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 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. Last fiddled with by danaj on 20160518 at 16:19 
20160518, 16:00  #80 
Sep 2002
Database er0rr
F24_{16} Posts 
But does it have AVX? If you are running Linux on it you can type cat /proc/cpuinfo to see. Under windows you have go clickety click somewhere
Last fiddled with by paulunderwood on 20160518 at 16:12 
20160518, 16:06  #81 
Sep 2002
Database er0rr
2^{2}·3·17·19 Posts 
No! The primes will thin out as they get bigger. You need to multiply by 8 and extrapolating from 10 seconds is useless.

20160518, 16:06  #82 
"NOT A TROLL"
Mar 2016
California
197 Posts 
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. 
20160518, 16:09  #83 
Sep 2002
Database er0rr
2^{2}×3×17×19 Posts 
time is a Linux command to measure timing.
Under windows it is used for setting the time!! Last fiddled with by paulunderwood on 20160518 at 16:10 
20160518, 16:14  #84 
"NOT A TROLL"
Mar 2016
California
197 Posts 
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...

20160518, 16:44  #85  
Aug 2002
5×1,663 Posts 
Quote:
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. 

20160518, 17:50  #86 
"Dana Jacobsen"
Feb 2011
Bangkok, TH
3^{2}·101 Posts 
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 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 oddlooking forms on the PRPtop site when I tried the number above. Now I know where they came from! 
20160518, 18:50  #87 
"NOT A TROLL"
Mar 2016
California
197 Posts 
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. 
20160518, 19:23  #88 
Aug 2002
5·1,663 Posts 
Do you have access to a Linux machine?
If not, there are many free possibilities. 
Thread Tools  
Similar Threads  
Thread  Thread Starter  Forum  Replies  Last Post 
Near and quasirepunit PRPs  Batalov  And now for something completely different  10  20190912 13:31 
OEIS  2^n5  LLTlike algorithm for finding PRPs  T.Rex  Miscellaneous Math  13  20150901 13:09 
PRPs not prime  schickel  FactorDB  1  20150803 02:50 
Proven PRPs?  Random Poster  FactorDB  0  20120724 10:53 
PRPs that are composites  gd_barnes  Conjectures 'R Us  57  20110912 12:31 