mersenneforum.org  

Go Back   mersenneforum.org > Prime Search Projects > Riesel Prime Search

Reply
 
Thread Tools
Old 2019-02-15, 06:58   #166
pepi37
 
pepi37's Avatar
 
Dec 2011
After milion nines:)

23×32×17 Posts
Default

Serge, I will hang myself to the first tree :)
Two primes, again you are convincingly leading in this class: but as I know you and Propper you will not stop here....


But on the other hand, I cannot beat those computer resources Propper have, so I must reconcile with destiny , and I must know what is my limits :))


Congratulations!
pepi37 is online now   Reply With Quote
Old 2019-02-15, 16:53   #167
paulunderwood
 
paulunderwood's Avatar
 
Sep 2002
Database er0rr

32×349 Posts
Default

Quote:
Originally Posted by Batalov View Post
But wait...!
99*10^1536527-1 is prime!

Congrats Serge and Ryan for this second Near-redigit prime.
paulunderwood is offline   Reply With Quote
Old 2019-02-15, 17:51   #168
Dr Sardonicus
 
Dr Sardonicus's Avatar
 
Feb 2017
Nowhere

3,049 Posts
Default

Congratulations!

Quote:
Originally Posted by Batalov View Post
But wait...!
Oh, goody! This is way better than the "there's more!" promised in scammercials infomercials.

I did notice something weird on the page showing the first of the two newly-discovered megaprimes:
Quote:
Running N+1 test using discriminant 3,
But-but-but--- 3 isn't a discriminant! Stickelberger's criterion for the discriminant, you know. The discriminant for Q(sqrt(3))/Q is 12.

Last fiddled with by Dr Sardonicus on 2019-02-15 at 18:01 Reason: Catching up with new info
Dr Sardonicus is offline   Reply With Quote
Old 2019-02-22, 16:13   #169
paulunderwood
 
paulunderwood's Avatar
 
Sep 2002
Database er0rr

32×349 Posts
Default

Serge and Ryan do it again:

993*10^1768283 - 1

Last fiddled with by paulunderwood on 2019-02-22 at 16:13
paulunderwood is offline   Reply With Quote
Old 2019-02-22, 18:39   #170
Dr Sardonicus
 
Dr Sardonicus's Avatar
 
Feb 2017
Nowhere

1011111010012 Posts
Default

Quote:
Originally Posted by paulunderwood View Post
Serge and Ryan do it again:

993*10^1768283 - 1
Verification still "InProcess," but I'm sure that's merely a formality, so congratulations in advance!


Last fiddled with by Dr Sardonicus on 2019-02-22 at 18:44
Dr Sardonicus is offline   Reply With Quote
Old 2019-02-22, 19:17   #171
pepi37
 
pepi37's Avatar
 
Dec 2011
After milion nines:)

23×32×17 Posts
Default

Quote:
Originally Posted by paulunderwood View Post
Serge and Ryan do it again:

993*10^1768283 - 1
I will always be second on third or 15 on the list :)

last time they go together they stopped at 5.2 M digits :))


But in any way, congratulations!

Last fiddled with by pepi37 on 2019-02-22 at 19:17
pepi37 is online now   Reply With Quote
Old 2019-02-23, 02:31   #172
LaurV
Romulan Interpreter
 
LaurV's Avatar
 
Jun 2011
Thailand

839510 Posts
Default

Nice job!
Congrats
LaurV is offline   Reply With Quote
Old 2019-02-26, 00:50   #173
Batalov
 
Batalov's Avatar
 
"Serge"
Mar 2008
Phi(3,3^1118781+1)/3

898710 Posts
Thumbs up

Speaking of other primes - Peter Kaiser's latest Quad is out there in outer space!
https://primes.utm.edu/top20/page.php?id=55

10,132 digits!

This quad has a remarkably high difficulty level! Congratulations to Peter!
Batalov is offline   Reply With Quote
Old 2019-02-26, 13:33   #174
Puzzle-Peter
 
Puzzle-Peter's Avatar
 
Jun 2009

29D16 Posts
Default

Thanks!
I am still trying to decide what to go for next. So many ideas but they are all probably too hard...
Puzzle-Peter is offline   Reply With Quote
Old 2019-02-26, 19:08   #175
Batalov
 
Batalov's Avatar
 
"Serge"
Mar 2008
Phi(3,3^1118781+1)/3

898710 Posts
Default

Every section of the specialized Top 20s is interesting in its own way. Breaks the monotony!

Try maybe Irregular primes (both kinds)*, ...maybe Generalized Lucas primitive part, maybe something else? They all need different attacks. All are interesting in their own way.
Well, except some categories :-) Some are just - "plan for a certain number of hours, and you will be done with the next sequence member". For example partition numbers. I am pretty sure that these could be in and out. I found an interesting twist for myself there trying to find a large prime partitions(n^2), and I did; there are no easy others. Maybe someone can find a large prime partitions(n^3)? (though I have probably already tried. I don't remember off the top of my head).

____________________
*That would be a lot of ECM; with a specific challenge: it is not documented anywhere how far others already ECMd. These are rather very refractory to attempts, in my experience.
Batalov is offline   Reply With Quote
Old 2019-02-26, 19:47   #176
paulunderwood
 
paulunderwood's Avatar
 
Sep 2002
Database er0rr

32·349 Posts
Default

The Fibonacci PRPs U(130021) and U(148091) are ripe for a multi-core Primo proof. Alternatively, there are some smaller Mersenne co-factors that need proofs.

Congrats for your latest quadruplet.

Last fiddled with by paulunderwood on 2019-02-26 at 19:58
paulunderwood is offline   Reply With Quote
Reply

Thread Tools


Similar Threads
Thread Thread Starter Forum Replies Last Post
Mersenne Primes p which are in a set of twin primes is finite? carpetpool Miscellaneous Math 3 2017-08-10 13:47
Distribution of Mersenne primes before and after couples of primes found emily Math 34 2017-07-16 18:44
Conjecture about Mersenne primes and non-primes v2 Mickey1 Miscellaneous Math 1 2013-05-30 12:32
A conjecture about Mersenne primes and non-primes Unregistered Information & Answers 0 2011-01-31 15:41
possible primes (real primes & poss.prime products) troels munkner Miscellaneous Math 4 2006-06-02 08:35

All times are UTC. The time now is 15:42.

Sat Apr 4 15:42:13 UTC 2020 up 10 days, 13:15, 1 user, load averages: 2.46, 1.98, 1.72

Powered by vBulletin® Version 3.8.11
Copyright ©2000 - 2020, 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.