![]() |
|
|
#23 |
|
"Rashid Naimi"
Oct 2015
Remote to Here/There
2,063 Posts |
|
|
|
|
|
|
#24 |
|
"NOT A TROLL"
Mar 2016
California
19710 Posts |
I am using less 2.16 Gz processor at 1.43 GB free of 21.1 GB. The code closed perl/ntheory after I had generated a 500k digit number, then inputed like this:
next_prime(301222712195683275475694172405967381…(500k more digits)…923131402845616754242989177076565862) then closed the window (I guess that's normal) so now next_prime(n) is limited to 8,147 digits since I can only input that much. |
|
|
|
|
|
#25 |
|
Sep 2002
Database er0rr
EB216 Posts |
If you goal is to find a random 500k digit probable prime, then run the script I wrote and then run: pfgw64 -f pf500000.txt if you are using 64 bit architecture.
I am not sure how efficient nextprime() is at 500k digits. Anyone? Last fiddled with by paulunderwood on 2016-05-15 at 19:45 |
|
|
|
|
|
#26 |
|
"NOT A TROLL"
Mar 2016
California
19710 Posts |
Thanks, I wanted someone to see if pfgw was a good idea in the first place, and I don't have Pari/Gp, but thanks for the code anyways.
|
|
|
|
|
|
#27 | |
|
Sep 2002
Database er0rr
EB216 Posts |
Quote:
|
|
|
|
|
|
|
#28 | |
|
"NOT A TROLL"
Mar 2016
California
197 Posts |
If possible, I would like to submit to the PRPtop10000
Quote:
There are others like me looking to submit the same "random" large prps, too. Last fiddled with by PawnProver44 on 2016-05-15 at 20:08 |
|
|
|
|
|
|
#29 | |
|
Sep 2002
Database er0rr
1110101100102 Posts |
I says there not to submit the decimal expansion:
Quote:
|
|
|
|
|
|
|
#30 |
|
"NOT A TROLL"
Mar 2016
California
19710 Posts |
There are no prps listed on factordb with 500k digits.
For the PRPtop10000 I would submit something like this: 121945672949...(499,976 more digits)...199475983221 Then give a link to the full expansion. Last fiddled with by PawnProver44 on 2016-05-15 at 20:20 |
|
|
|
|
|
#31 |
|
"Rashid Naimi"
Oct 2015
Remote to Here/There
2,063 Posts |
Chances are they won't be automatically processed and included. The web form might even reject the vague submission.
|
|
|
|
|
|
#32 |
|
"NOT A TROLL"
Mar 2016
California
19710 Posts |
Here is a quick result (took me a few weeks to get):
nextprime(134563103048...(12,430 missing digits) ....330053155897) = 134563103048.........330053158549 I expected only a day for that. Sorry for the horizontal scroll. Fixed 24 digits instead. Last fiddled with by PawnProver44 on 2016-05-15 at 20:37 |
|
|
|
|
|
#33 | |
|
Sep 2002
Database er0rr
2·32·11·19 Posts |
Quote:
Last fiddled with by paulunderwood on 2016-05-15 at 20:43 |
|
|
|
|
![]() |
| Thread Tools | |
Similar Threads
|
||||
| Thread | Thread Starter | Forum | Replies | Last Post |
| Near- and quasi-repunit PRPs | Batalov | And now for something completely different | 10 | 2019-09-12 13:31 |
| OEIS - 2^n-5 - LLT-like algorithm for finding PRPs | T.Rex | Miscellaneous Math | 13 | 2015-09-01 13:09 |
| PRPs not prime | schickel | FactorDB | 1 | 2015-08-03 02:50 |
| Proven PRPs? | Random Poster | FactorDB | 0 | 2012-07-24 10:53 |
| PRPs that are composites | gd_barnes | Conjectures 'R Us | 57 | 2011-09-12 12:31 |