![]() |
|
|
#221 | |
|
"Serge"
Mar 2008
Phi(4,2^7658614+1)/2
949410 Posts |
Quote:
Of course, everyone can run yet another PRP test on a known prime, but it doesn't make it a meaningful exercise. It is wasteful for those who are unfamiliar with the Cunningham project to go below "min_exponent=1300" (or, with its extensions, below 2400). Dario is correct that the PRP-5701 is trivially proven prime. For comparison, Wu has just recently proven a Wagstaff prime as large as 25,000 decimal digits. An ECPP proof for any number up to, say, 10000 decimal digits is a rather trivial exercise in 2014. |
|
|
|
|
|
|
#222 |
|
"Adolf"
Nov 2013
South Africa
61 Posts |
My apologies.
I guess (maybe I should not guess ) that there is more to than just putting a PRP line from that page in P95 and running it, and then getting an answer yes it is PRP or not, and then telling someone about it. My favorite RDS will probably agree ![]() I have some homework to do if i want to know that is all about. Adolf |
|
|
|
|
|
#223 | |
|
Account Deleted
"Tim Sorbera"
Aug 2006
San Antonio, TX USA
17×251 Posts |
Quote:
So far, I'm at 18565/18938 bits.
|
|
|
|
|
|
|
#224 |
|
Aug 2002
Buenos Aires, Argentina
25268 Posts |
I ran the P-1 factorization method with B1=200K, B2=5M on the range 900000-990000 and B1=2M, B2=50M on the range 990000-1000000, for the Mersenne numbers that already have known factors (in previous months I'd ran P-1 with B1=10M, B2=500M on all Mersenne numbers without known factors).
After finding more than 600 new prime factors, I ran PRP on the cofactors, but no new PRP appeared. I started P-1 with B1=300K, B2=10M on the composite Mersenne numbers with exponents in the range 800000-900000. |
|
|
|
|
|
#225 | |
|
Account Deleted
"Tim Sorbera"
Aug 2006
San Antonio, TX USA
17·251 Posts |
Quote:
|
|
|
|
|
|
|
#226 |
|
Aug 2002
Buenos Aires, Argentina
2·683 Posts |
Stop the presses!!!
After finding more than 1700 new prime factors of Mersenne numbers in the range 700K - 1M using P-1 algorithm, I finally discovered a PRP: M750,151 = 429934042631 * 7590093831289 * 397764574647511 * 8361437834787151 * 17383638888678527263 * PRP-225744 |
|
|
|
|
|
#227 |
|
"Curtis"
Feb 2005
Riverside, CA
22·1,217 Posts |
Nice find! I suppose Primo won't prove it prime for a while yet... :)
|
|
|
|
|
|
#228 |
|
"Serge"
Mar 2008
Phi(4,2^7658614+1)/2
2·47·101 Posts |
Earth, also known as Sol 3, was a giant supercomputer designed to prove the primality of this number. Designed by Deep Thought and built by the Magratheans, it was commonly mistaken for a planet, especially by the ape descendants who lived on it. It was situated far out in the uncharted backwaters of the unfashionable end of the Western Spiral Arm of the Galaxy.
Unfortunately, the Earth was destroyed by the Vogons five minutes before the program was to be completed. |
|
|
|
|
|
#229 | |
|
"Curtis"
Feb 2005
Riverside, CA
486810 Posts |
Quote:
Thanks for this. |
|
|
|
|
|
|
#230 |
|
Jun 2003
2×3×7×112 Posts |
There is something to be said for dumb luck.
Code:
M3464473/604874508299177 is a probable prime! We4: E866B6FC,00000000 EDIT:- Anybody know how to make P95 use a different base to do the PRP test? Last fiddled with by axn on 2014-10-12 at 09:57 |
|
|
|
|
|
#231 |
|
Aug 2002
Buenos Aires, Argentina
55616 Posts |
That's the first Mega-PRP cofactor of a Mersenne number known. Congratulations.
|
|
|
|
![]() |
| Thread Tools | |
Similar Threads
|
||||
| Thread | Thread Starter | Forum | Replies | Last Post |
| Smallest exponent for mersenne not-factored | preda | PrimeNet | 10 | 2018-11-04 00:47 |
| Largest Mersenne Number Fully Factored? | c10ck3r | Data | 49 | 2017-12-10 19:39 |
| Possibility of a Fully-Factored Number | Trejack | FactorDB | 7 | 2016-05-14 05:38 |
| Estimating the number of primes in a partially-factored number | CRGreathouse | Probability & Probabilistic Number Theory | 15 | 2014-08-13 18:46 |
| Number of distinct prime factors of a Double Mersenne number | aketilander | Operazione Doppi Mersennes | 1 | 2012-11-09 21:16 |