![]() |
![]() |
#1 |
"W. Byerly"
Aug 2013
81*2^3174353-1
8516 Posts |
![]()
3*5*11*13*98584369*2^25615- 1 is 3-PRP! (5.6118s+ 0.0005s)
3*5*11*13*98584369*2^25970- 1 is 3-PRP! (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) |
![]() |
![]() |
![]() |
#2 |
Nov 2003
E2616 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 |
![]() |
![]() |
![]() |
#3 | |
Feb 2003
27·3·5 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^25615-1 [N+1, Brillhart-Lehmer-Selfridge] Running N+1 test using discriminant 7, base 1+sqrt(7) Calling Brillhart-Lehmer-Selfridge with factored part 99.86% 3*5*11*13*98584369*2^25615-1 is prime! (2.5064s+0.0001s) |
|
![]() |
![]() |
![]() |
#4 |
"W. Byerly"
Aug 2013
81*2^3174353-1
7×19 Posts |
![]()
Ok, I tried that and it works, before it crashed when I tried LLR with the file directly outputted from newpgen
|
![]() |
![]() |
![]() |
Thread Tools | |
![]() |
||||
Thread | Thread Starter | Forum | Replies | Last Post |
48-bit large primes! | jasonp | Msieve | 24 | 2010-06-01 19:14 |
lots of large primes | Peter Hackman | Factoring | 2 | 2008-08-15 14:26 |
NFS with 5 and 6 large primes | jasonp | Factoring | 4 | 2007-12-04 18:32 |
Why only three large primes | fivemack | Factoring | 18 | 2007-05-10 12:14 |
What is the use of these large primes | Prime Monster | Lounge | 34 | 2004-06-10 18:12 |