- **Riesel Prime Search**
(*https://www.mersenneforum.org/forumdisplay.php?f=59*)

- - **Other Primes**
(*https://www.mersenneforum.org/showthread.php?t=6374*)

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! |

[QUOTE=Batalov;508606]But wait...![/QUOTE]
[URL="https://primes.utm.edu/primes/page.php?id=126113"]99*10^1536527-1 is prime![/URL] Congrats Serge and Ryan for this second Near-redigit prime. :banana: |

Congratulations!
:tu: [QUOTE=Batalov;508606]But wait...![/QUOTE] Oh, goody! This is [i]way[/i] better than the "there's more!" promised in [strike]scammercials[/strike] 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,[/quote]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. |

Serge and Ryan do it again:
[URL="https://primes.utm.edu/primes/page.php?id=126215"]993*10^1768283 - 1[/URL] :banana: |

[QUOTE=paulunderwood;509141]Serge and Ryan do it again:
[URL="https://primes.utm.edu/primes/page.php?id=126215"]993*10^1768283 - 1[/URL] :banana:[/QUOTE] Verification still "InProcess," but I'm sure that's merely a formality, so congratulations in advance! :beer2: :beer2: :party: |

[QUOTE=paulunderwood;509141]Serge and Ryan do it again:
[URL="https://primes.utm.edu/primes/page.php?id=126215"]993*10^1768283 - 1[/URL] :banana:[/QUOTE] 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! |

Nice job!
Congrats :party: |

Speaking of other primes - Peter Kaiser's latest Quad is out there in outer space!
[url]https://primes.utm.edu/top20/page.php?id=55[/url] [B]10,132 digits! [/B] This quad has a remarkably high difficulty level! Congratulations to Peter! |

Thanks!
I am still trying to decide what to go for next. So many ideas but they are all probably too hard... |

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 [I]others [/I]already ECMd. These are rather very refractory to attempts, in my experience. |

The Fibonacci PRPs [URL="https://primes.utm.edu/top20/page.php?id=39"]U(130021) and U(148091)[/URL] are ripe for a multi-core Primo proof. Alternatively, there are some smaller Mersenne co-factors that need proofs.
Congrats for your latest quadruplet. |

All times are UTC. The time now is 17:39. |

Powered by vBulletin® Version 3.8.11

Copyright ©2000 - 2023, Jelsoft Enterprises Ltd.