mersenneforum.org  

Go Back   mersenneforum.org > New To GIMPS? Start Here! > Information & Answers

Reply
 
Thread Tools
Old 2016-05-15, 19:29   #23
a1call
 
a1call's Avatar
 
"Rashid Naimi"
Oct 2015
Remote to Here/There

2,063 Posts
Default

Quote:
Originally Posted by PawnProver44 View Post
for perl/ntheory my guess? That code just restarted my computer for some reason?
My guess: you are running out of RAM.
a1call is offline   Reply With Quote
Old 2016-05-15, 19:37   #24
PawnProver44
 
PawnProver44's Avatar
 
"NOT A TROLL"
Mar 2016
California

110001012 Posts
Post

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.
PawnProver44 is offline   Reply With Quote
Old 2016-05-15, 19:41   #25
paulunderwood
 
paulunderwood's Avatar
 
Sep 2002
Database er0rr

72628 Posts
Default

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
paulunderwood is offline   Reply With Quote
Old 2016-05-15, 19:53   #26
PawnProver44
 
PawnProver44's Avatar
 
"NOT A TROLL"
Mar 2016
California

C516 Posts
Post

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.
PawnProver44 is offline   Reply With Quote
Old 2016-05-15, 19:56   #27
paulunderwood
 
paulunderwood's Avatar
 
Sep 2002
Database er0rr

2×32×11×19 Posts
Default

Quote:
Originally Posted by PawnProver44 View Post
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.
You get a windows version for free (and be free) at http://pari.math.u-bordeaux.fr/download.html
paulunderwood is offline   Reply With Quote
Old 2016-05-15, 20:06   #28
PawnProver44
 
PawnProver44's Avatar
 
"NOT A TROLL"
Mar 2016
California

C516 Posts
Post

If possible, I would like to submit to the PRPtop10000

Quote:
Originally Posted by axn View Post
The submission page lists 20,000 digit as the minimum. But to actually enter Top 10000, it should be 42k+.

The submission page also says that


So it is possible that if your number doesn't have a compact form, it might not be accepted.
I hope it works.

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
PawnProver44 is offline   Reply With Quote
Old 2016-05-15, 20:09   #29
paulunderwood
 
paulunderwood's Avatar
 
Sep 2002
Database er0rr

2·32·11·19 Posts
Default

I says there not to submit the decimal expansion:

Quote:
The probable primes you have found :
(please type one number by line using the following format :
number,its number of digits in base 10
and don't type their decimal expansion ;-)
)
Would factordb accept it?
paulunderwood is offline   Reply With Quote
Old 2016-05-15, 20:18   #30
PawnProver44
 
PawnProver44's Avatar
 
"NOT A TROLL"
Mar 2016
California

197 Posts
Post

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
PawnProver44 is offline   Reply With Quote
Old 2016-05-15, 20:29   #31
a1call
 
a1call's Avatar
 
"Rashid Naimi"
Oct 2015
Remote to Here/There

206310 Posts
Default

Quote:
Originally Posted by PawnProver44 View Post
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.
Chances are they won't be automatically processed and included. The web form might even reject the vague submission.
a1call is offline   Reply With Quote
Old 2016-05-15, 20:33   #32
PawnProver44
 
PawnProver44's Avatar
 
"NOT A TROLL"
Mar 2016
California

197 Posts
Post

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
PawnProver44 is offline   Reply With Quote
Old 2016-05-15, 20:39   #33
paulunderwood
 
paulunderwood's Avatar
 
Sep 2002
Database er0rr

2×32×11×19 Posts
Default

Quote:
Originally Posted by PawnProver44 View Post
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.
If this took you a "few weeks" to get then either you were very unlucky or something was up, like non-resumption or no trial division

Last fiddled with by paulunderwood on 2016-05-15 at 20:43
paulunderwood is offline   Reply With Quote
Reply

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

All times are UTC. The time now is 14:39.


Mon Aug 2 14:39:11 UTC 2021 up 10 days, 9:08, 0 users, load averages: 4.07, 4.29, 3.97

Powered by vBulletin® Version 3.8.11
Copyright ©2000 - 2021, Jelsoft Enterprises Ltd.

This forum has received and complied with 0 (zero) government requests for information.

Permission is granted to copy, distribute and/or modify this document under the terms of the GNU Free Documentation License, Version 1.2 or any later version published by the Free Software Foundation.
A copy of the license is included in the FAQ.