[QUOTE=paulunderwood;514161]Congrats to GENERIC for the primes [p,p+6] = (18041#/14*2^390034)±3.
[url]http://primepairs.com/[/url][/QUOTE] That is just painful. I mean the ecpp proof for the hard number when you have a much cheaper way, searching a better form. Say 2^a divides p1 3^b divides p+5 ofcourse you want 2^a~3^b (~sqrt(N)) because then you know large p1,(p+6)1 factors in the oder of sqrt(N), so a=floor(log(N)/log(2)/2) b=floor(log(N)/log(3)/2) you can search p in the form (because 2^a and 3^b are coprime): p=u*2^a+v*3^b, from divisibilities you can get: [CODE] v*3^b==1 mod 2^a u*2^a==5 mod 3^b [/CODE] Don't need to run two variables, fix u, then run v in arithmetic progression. Use sieving. 
[QUOTE=R. Gerbicz;514165]That is just painful. I mean the ecpp proof for the hard number when you have a much cheaper way, searching a better form.
Say 2^a divides p1 3^b divides p+5 ofcourse you want 2^a~3^b (~sqrt(N)) because then you know large p1,(p+6)1 factors in the oder of sqrt(N), so a=floor(log(N)/log(2)/2) b=floor(log(N)/log(3)/2) you can search p in the form (because 2^a and 3^b are coprime): p=u*2^a+v*3^b, from divisibilities you can get: [CODE] v*3^b==1 mod 2^a u*2^a==5 mod 3^b [/CODE] Don't need to run two variables, fix u, then run v in arithmetic progression. Use sieving.[/QUOTE] Somebody, maybe GENERIC with his 16 core Threadripper, should try to beat his record with the above method: The gauntlet has been thrown down! 
[QUOTE=R. Gerbicz;514165]That is just painful. I mean the ecpp proof for the hard number when you have a much cheaper way, searching a better form.
Don't need to run two variables, fix u, then run v in arithmetic progression. Use sieving.[/QUOTE] Exactly! This new thingy completely misses the precious beauty of [URL="https://groups.yahoo.com/neo/groups/primenumbers/conversations/topics/20207"]Ken Davis' construction[/URL]. Surely now, 10 years later, one can repeat Ken's trick to find a couple 40,000digit sexy primes. I added a little [URL="https://mersenneforum.org/showthread.php?t=24317"]friendly competition thread[/URL]. Have some fun! 
[QUOTE=paulunderwood;514164]I'd argue Peter's triplet is not so sexy since there is a prime at 6521953289619 * 2^55555  1 :boxer:
On the other hand: there is a prime between 17 and 23 :down:[/QUOTE] YepI And that is what we call a triplet, which at least for large enough numbers is more important than just a pair of sexy primes. 😋 
[QUOTE=paulunderwood;514161]Congrats to GENERIC for the primes [p,p+6] = (18041#/14*2^390034)±3.
[URL]http://primepairs.com/[/URL][/QUOTE] Well, that world record didn't live long... 
A new Cunningham Chain of the 2[SUP]nd[/SUP] kind was published a few days ago.
Congratulations to Serge Batalov on the record. (2p+1) 556336461 · 2[SUP]211356[/SUP]  1 with 63634 Digits [URL="https://primes.utm.edu/primes/page.php?id=126495"]HERE[/URL] The previous record had 52726 digits. 
Congrats to Ryan for a [URL="https://primes.utm.edu/primes/page.php?id=129914"]top20 prime[/URL] 7*6^6772401+1 (5269954 digits) :banana:

Small but sweet :)
[Worker #1 Sep 18 17:41:47] 9*10^380734+1 is a probable prime! Wh8: 0976AF3D,00000000 And of course it is proven prime with LLR :) :party: 
This one has not been yet verified but it looks genuine.
6962 · 31[sup]2863120[/sup]  1 4269952 Digits. Largest of the year. Will rank 20 if verified. [url]https://primes.utm.edu/primes/page.php?id=130702[/url] 
Congrats to Ryan Propper for his recent batch of proth mega primes for k = 9, 11 and 13 the largest of which has 3,462,100 digits :smile:

[QUOTE=paulunderwood;539623]Congrats to Ryan Propper for his recent batch of proth mega primes for k = 9, 11 and 13 the largest of which has 3,462,100 digits :smile:[/QUOTE]
What ranges was Propper searching, and did he keep the residues of all the composite candidates he must have covered? This information could be useful to PrimeGrid which is planning to search and doublecheck (at least a part of) these Proth number regions, see [URL="https://www.primegrid.com/stats_div_llr.php"]https://www.primegrid.com/stats_div_llr.php[/URL]. /JeppeSN 
All times are UTC. The time now is 15:25. 
Powered by vBulletin® Version 3.8.11
Copyright ©2000  2023, Jelsoft Enterprises Ltd.