20130818, 21:29  #1 
"W. Byerly"
Aug 2013
1423*2^21790231
107 Posts 
Where do I send my PRP primes with large k?
3*5*11*13*98584369*2^25615 1 is 3PRP! (5.6118s+ 0.0005s)
3*5*11*13*98584369*2^25970 1 is 3PRP! (5.7561s+ 0.0006s) Where would I send these along with other primes to prove they are primes? I can't use proth and llr they won't accept it. (Yes I know my computer is slow) 
20130819, 01:30  #2 
Nov 2003
2·1,811 Posts 
LLR can prove primality of your PRPs. Just replace k with its numerical value (instead of product of its factors) and attach the right header:
1000:M:1:2:2 211463471505 25615 211463471505 25970 
20130819, 09:01  #3  
Feb 2003
1908_{10} Posts 
Quote:
if you stick to PFGW, you can test the primality using the "tp" switch, e.g.: Code:
pfgw tp inputfile.txt Code:
Primality testing 3*5*11*13*98584369*2^256151 [N+1, BrillhartLehmerSelfridge] Running N+1 test using discriminant 7, base 1+sqrt(7) Calling BrillhartLehmerSelfridge with factored part 99.86% 3*5*11*13*98584369*2^256151 is prime! (2.5064s+0.0001s) 

20130820, 00:32  #4 
"W. Byerly"
Aug 2013
1423*2^21790231
107 Posts 
Ok, I tried that and it works, before it crashed when I tried LLR with the file directly outputted from newpgen

Thread Tools  
Similar Threads  
Thread  Thread Starter  Forum  Replies  Last Post 
48bit large primes!  jasonp  Msieve  24  20100601 19:14 
lots of large primes  Peter Hackman  Factoring  2  20080815 14:26 
NFS with 5 and 6 large primes  jasonp  Factoring  4  20071204 18:32 
Why only three large primes  fivemack  Factoring  18  20070510 12:14 
What is the use of these large primes  Prime Monster  Lounge  34  20040610 18:12 