mersenneforum.org  

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

Reply
 
Thread Tools
Old 2016-05-18, 04:54   #67
PawnProver44
 
PawnProver44's Avatar
 
"NOT A TROLL"
Mar 2016
California

197 Posts
Post

Here's the truth: I had asked someone for help to organize all the scripts, and they did that for me and showed me the proper output several times. However, they refused to give the prp's decimal expansion until I show them a proper output that I did myself.
PawnProver44 is offline   Reply With Quote
Old 2016-05-18, 05:09   #68
PawnProver44
 
PawnProver44's Avatar
 
"NOT A TROLL"
Mar 2016
California

C516 Posts
Post

I decided to put my largest found prp in an attachemt for proof that my claim about finding a 6056 digit prp is true. (though I just realized this now.)

If anyone does a proof on it, then becomes my largest found prime.
Attached Files
File Type: txt prp_6056.txt (5.9 KB, 44 views)

Last fiddled with by PawnProver44 on 2016-05-18 at 05:13
PawnProver44 is offline   Reply With Quote
Old 2016-05-18, 05:15   #69
PawnProver44
 
PawnProver44's Avatar
 
"NOT A TROLL"
Mar 2016
California

C516 Posts
Post

Are you talking about my 6056 digit prp or the one that I asked for help on and the people who helped me find it refuse to upload the decimal expansion?

EDIT: What just happened to post #69 I saw a few seconds ago?!?!

Last fiddled with by PawnProver44 on 2016-05-18 at 05:18
PawnProver44 is offline   Reply With Quote
Old 2016-05-18, 05:18   #70
paulunderwood
 
paulunderwood's Avatar
 
Sep 2002
Database er0rr

353310 Posts
Default

I tested it with my FU algorithm and it passed. It took about 5 seconds. ECPP would take several hours (??) and would give proof of primality -- 100%.
paulunderwood is offline   Reply With Quote
Old 2016-05-18, 05:19   #71
PawnProver44
 
PawnProver44's Avatar
 
"NOT A TROLL"
Mar 2016
California

3058 Posts
Post

What does your "FU" algorithm stand for?
PawnProver44 is offline   Reply With Quote
Old 2016-05-18, 05:20   #72
paulunderwood
 
paulunderwood's Avatar
 
Sep 2002
Database er0rr

3,533 Posts
Default

Quote:
Originally Posted by PawnProver44 View Post
Are you talking about my 6056 digit prp or the one that I asked for help on and the people who helped me find it refuse to upload the decimal expansion?

EDIT: What just happened to post #69 I saw a few seconds ago?!?!
I deleted it, because I thought you had found a ~200k digit PRP, which I was willing to test for you. If you have found such a PRP, send it to me at paulunderwood@mindless.com

Last fiddled with by paulunderwood on 2016-05-18 at 05:26
paulunderwood is offline   Reply With Quote
Old 2016-05-18, 05:25   #73
paulunderwood
 
paulunderwood's Avatar
 
Sep 2002
Database er0rr

3,533 Posts
Default

Quote:
Originally Posted by PawnProver44 View Post
What does your "FU" algorithm stand for?
It tests (x+2)^(n+1) == 5+2*a (mod n, x^2-a*x+1) where a >= 0 is minimal such that jacobiSymbol(a^2-4,n)==-1. You can find my paper on it here. I have done several implementations: javaScript, Ruby and GWNUM. The latter is quick and is the one I would use to test a 200k digit number
paulunderwood is offline   Reply With Quote
Old 2016-05-18, 05:28   #74
PawnProver44
 
PawnProver44's Avatar
 
"NOT A TROLL"
Mar 2016
California

197 Posts
Post

Quote:
Originally Posted by paulunderwood View Post
I deleted it, because I thought you had found a ~200k PRP, which I was willing to test for you. If you have found such a PRP, send it to me at paulunderwood@mindless.com
yes, I has asked someone find that for me, but when I asked for an attachment with the decimal expansion, they said that I should find my own prp that size. I did however get average timing, and sieving up to 2e+10, with that showed me it only took about 2 to 4 days? Sounds weird.

Last fiddled with by PawnProver44 on 2016-05-18 at 05:29
PawnProver44 is offline   Reply With Quote
Old 2016-05-18, 05:46   #75
LaurV
Romulan Interpreter
 
LaurV's Avatar
 
Jun 2011
Thailand

2·23·199 Posts
Default

The ~6k digit number is either a carmichael or a prime, it passed a random, 50-digit, prime bases PRP test. Like in "for(i=1,100,print([b=nextprime(random(10^50)), lift(Mod(b,n)^(n-1))]))" (ran in 4 cores, each base runs below 10 seconds on my laptop). Say your number is prime, with a probability of "99.9..(another~800 of nines)..9%". Now next step for you is to extend the ~6000 digits to ~200000 digits...
LaurV is online now   Reply With Quote
Old 2016-05-18, 15:25   #76
PawnProver44
 
PawnProver44's Avatar
 
"NOT A TROLL"
Mar 2016
California

C516 Posts
Default

For this let me assume that there are 16,814 candidates remaining each sieve (to 2e+10) for 200k digits: Prp test takes (first please what is the time increase by doubling the number of digits?) Looked at a prime 400k digits here and took about 12 min.)
PawnProver44 is offline   Reply With Quote
Old 2016-05-18, 15:36   #77
paulunderwood
 
paulunderwood's Avatar
 
Sep 2002
Database er0rr

3,533 Posts
Default

That timing was on a 3.5GHz core with AVX using special mod. For Generic mod you can multiply by 4. For non-AVX you can multiply by 2 (??) and I will leave it to you work out the difference for your clock and 3.5GHz. Finally you can divide by 4 for a 200k number. Let's call it 40 minutes on your 2.15 GHz if it does not have AVX. So to find a 200k PRP you will need to do ~7000*40 core minutes i.e. 195 core days plus sieving time

Last fiddled with by paulunderwood on 2016-05-18 at 15:55
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 13:30.

Sun Jan 24 13:30:04 UTC 2021 up 52 days, 9:41, 0 users, load averages: 3.35, 3.20, 3.15

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.