[QUOTE=rebirther;562383]43*182^502611-1 found by vaughan (1135939 digits)

the base is now proven![/QUOTE]
:bow wave:

78*236^402022-1 found by KySU (953965 digits)


base proven

Wow - congrats!

[QUOTE=rebirther;563867]78*236^402022-1 found by KySU (953965 digits)

base proven[/QUOTE]


:bow wave: AGAIN!!

[QUOTE=rebirther;563867]78*236^402022-1 found by KySU (953965 digits)


base proven[/QUOTE]

:bounce:

Congratulations :smile:

and cool, very cool indeed, how many bases have SRBase proven from the beginning up until now? :smile:

[QUOTE=KEP;563936]:bounce:

Congratulations :smile:

and cool, very cool indeed, how many bases have SRBase proven from the beginning up until now? :smile:[/QUOTE]

21

[QUOTE=rebirther;563937]21[/QUOTE]

:showoff:

2415*288^209272+1 found by KySU (514686 digits)
968*288^235591+1 found by 3DpNKyXhViXrNkzNVoTcy7VQKmKS (579414 digits)

53*248^368775+1 found by [SG-FC] dingdong (883016 digits)

354*994^166791+1 found by [AF>Amis de la Mer] ComteZera (499940 digits)

14056*381^182324+1 found by SystemViper (470569 digits)

2416*138^219421+1 found by grcpool.com (469538 digits)
866*138^222803+1 found by KySU (476775 digits)
141*138^244616+1 found by Ralfy (523451 digits)
1789*138^271671+1 found by IDEA (581347 digits)
1019*138^274533+1 found by Neriyah (587471 digits)
2354*138^314727+1 found by eLPeCKo (673482 digits)
2189*138^345010+1 found by KySU (738284 digits)

1706*123^339764+1 found by CharityEngine2 (710078 digits)

172*107^242649-1 found by grcpool.com (492431 digits)
88*107^273915-1 found by Ralfy (555881 digits)
118*107^314663-1 found by nagasan64 (638575 digits)
116*107^455562-1 found by vaughan (924513 digits)

117*412^294963+1 is prime. It is 771300 digits long. It has been a while since I've added one to the Top 5000. This conjecture is down to 2 ks. I'm still searching.

838*367^198905+1 found by KySU (510128 digits)

2707*352^224386+1 found by KySU (571412 digits)

Big news from PrimeGrid:

9221*2^11392194-1 is prime!!

See: [URL]https://primes.utm.edu/primes/page.php?id=131777[/URL]

This was the 2nd smallest k remaining on the Riesel base 2 effort. Only k=2293 remaining is smaller.

Even better news: It knocks out the same CRUS k remaining for both R2 and R4! It is also far bigger than the previous largest R4 prime. :-)

A hearty congrats to PrimeGrid! :smile:

[QUOTE=gd_barnes;571411]Big news from PrimeGrid:

9221*2^11392194-1 is prime!!

See: [URL]https://primes.utm.edu/primes/page.php?id=131777[/URL]

This was the 2nd smallest k remaining on the Riesel base 2 effort. Only k=2293 remaining is smaller.

Even better news: It knocks out the same CRUS k remaining for both R2 and R4! It is also far bigger than the previous largest R4 prime. :-)

A hearty congrats to PrimeGrid! :smile:[/QUOTE]

:groupwave:

[QUOTE=gd_barnes;571411]Big news from PrimeGrid:


This was the 2nd smallest k remaining on the Riesel base 2 effort. Only k=2293 remaining is smaller.
[/QUOTE]

Awesome news. How many k remain for the Riesel problem? 48, 49?

[QUOTE=masser;571428]Awesome news. How many k remain for the Riesel problem? 48, 49?[/QUOTE]

47 remain for the original Riesel problem.

Here it is 49 remaining including the two even k's.

...and just like that...

Even bigger news from Ryan Propper:

2293*2^12918431-1 is prime!!

See: [URL]https://primes.utm.edu/primes/page.php?id=131882[/URL]

So...within less than a week of each other PrimeGrid and Ryan have knocked out the two smallest k's remaining on the Riesel base 2 effort.

Even better news: It also knocks out CRUS k=4586 for R4 and k=18344 for R16!

Congrats to Ryan! :smile:

[QUOTE=gd_barnes;571411]
9221*2^11392194-1 is prime!!
[/QUOTE]

[QUOTE=gd_barnes;571622]
2293*2^12918431-1 is prime!!
[/QUOTE]


YAY! That's indeed news! Big congrats to the finders!
:party:
Is somebody still updating Mr. Keller's pages? Were they announced?
I see none of them in his status page, and Ryan's result is so new didn't make it yet into the PG [URL="http://www.primegrid.com/stats_trp_llr.php"]status page[/URL]. Or was Ryan working independently, and scared the heck out of PrimeGrid? :lol:

[QUOTE=LaurV;571635]YAY! That's indeed news! Big congrats to the finders!
:party:
Is somebody still updating Mr. Keller's pages? Were they announced?
I see none of them in his status page, and Ryan's result is so new didn't make it yet into the PG [URL="http://www.primegrid.com/stats_trp_llr.php"]status page[/URL]. Or was Ryan working independently, and scared the heck out of PrimeGrid? :lol:[/QUOTE]


They are probably so new that they haven't been announced yet.

As best as I can tell Ryan works entirely independently of any project. None of his proof codes at top-5000 have a project ID in them.

To my knowledge Prof. Keller updates his own pages and continues to do so. The last update dates on many of them were early in February so very recent. I'm confident that he will update them when these finds are formalized.

The Wiki contains a page for the [url='https://www.rieselprime.de/ziki/Riesel_problem']Riesel problem[/url] and also for the [url='https://www.rieselprime.de/ziki/PrimeGrid_Riesel_Problem']Prime Grid project[/url].

k=2293 is still shown for the project, because it's not known, if there exists a smaller prime for that k-value.
Ryan Propper do not publish any ranges he's doing in any of his searches. This will keep gaps in search ranges like for [url='https://www.rieselprime.de/ziki/Riesel_prime_2293']k=2293[/url]. I also can not create a history (others than on W.Kellers page), only the primes found are noticeable.

[QUOTE=kar_bon;571647]k=2293 is still shown for the project, because it's not known, if there exists a smaller prime for that k-value.
Ryan Propper do not publish any ranges he's doing in any of his searches.[/QUOTE]

I am searching 12M <= n < =15M for a few k's.

[QUOTE=ryanp;571666]I am searching 12M <= n < =15M for a few k's.[/QUOTE]

As you probably know someone over at PrimeGrid has accused you of poaching. Not knowing the history I have no opinion on whether or not poaching occurred here.

[QUOTE=rogue;571673]As you probably know someone over at PrimeGrid has accused you of poaching. Not knowing the history I have no opinion on whether or not poaching occurred here.[/QUOTE]

I was not aware, but am not particularly surprised. As it happens, I tried to pick a range that I thought was disjoint from what PG was searching. /shrug

Presumably they can reallocate the resources to searching on the other k's, no?

[QUOTE=ryanp;571680]I was not aware, but am not particularly surprised. As it happens, I tried to pick a range that I thought was disjoint from what PG was searching. /shrug

Presumably they can reallocate the resources to searching on the other k's, no?[/QUOTE]

Since they do not have any residues for the n smaller than the one that yielded a prime they will search the n below that prime that have not been tested.

Out of curiosity did you do your own sieving or did you use the file they have? If you did your own sieving, then AFAIAC, it is sour grapes on their part. I'm sure that you had the best of intentions, but I'm also certain that PrimeGrid would not have relinquished any tests to someone else once they believed that they had control over the search.

[QUOTE=rogue;571684]Since they do not have any residues for the n smaller than the one that yielded a prime they will search the n below that prime that have not been tested.

Out of curiosity did you do your own sieving or did you use the file they have?[/QUOTE]

I did my own sieving. I wasn't even aware they had sieved k=2293 for 12e6 <= n <= 15e6.

Ryan, you're aware of the Wiki and also got an account: please let us know your searched ranges here or in the Wiki to avoid doblechecks or doing others work. On your [url='https://www.rieselprime.de/ziki/Ryan_Propper']Person-page[/url] there're several reserved values, but only found primes are known, no ranges.
I'm trying to keep those data for history and for others to make searches in such high ranges not disappointed for anybody. Filling in missing/not known ranges in prime search is a unlikely work for everybody but to keep it scientific under the aspect of a mathmatical proof it's necessary.

[QUOTE=rogue;571673]As you probably know someone over at PrimeGrid has accused you of poaching. Not knowing the history I have no opinion on whether or not poaching occurred here.[/QUOTE]

:karma:

326*80^398799+1 found by Ralfy (758953 digits)
295*80^404886+1 found by grcpool.com-3 (770537 digits)
628*80^491322+1 found by grc.arikado.pool (935033 digits)

[URL="https://primes.utm.edu/primes/page.php?id=132068"]280 * 53^333574+1 is prime :)[/URL]

3580*408^222030+1 found by KySU (579649 digits)

1693*396^228140+1 found by axelpq (592642 digits)
4821*396^263301+1 found by KySU (683980 digits)
3338*396^280633+1 found by grcpool.com-3 (729003 digits)
2136*396^285974+1 found by FoulOleRon (742877 digits)
1818*378^217098+1 found by Viktor Svantner (559572 digits)
5428*378^249058+1 found by eLPeCKo (641949 digits)
3478*378^260076+1 found by Doug (670348 digits)

27*342^232379+1 found by LennStar (588856 digits)
552*360^230680+1 found by Lars_Seidel (589691 digits)

A dream came true :)
 

On March 28th at 09:44 local time, a dream came true :smile:

One of my Ryzen PC's found following prime:

[URL="https://primes.utm.edu/primes/page.php?id=132189"]104*383^408249+1[/URL]

It is 1,054,591 digits :smile: and it enters at 449th largest prime :smile:

[QUOTE=KEP;574735]On March 28th at 09:44 local time, a dream came true :smile:

One of my Ryzen PC's found following prime:

[URL="https://primes.utm.edu/primes/page.php?id=132189"]104*383^408249+1[/URL]

It is 1,054,591 digits :smile: and it enters at 449th largest prime :smile:[/QUOTE]

Congrats! How many k left in S383?

[QUOTE=KEP;574735]On March 28th at 09:44 local time, a dream came true :smile:

One of my Ryzen PC's found following prime:

[URL="https://primes.utm.edu/primes/page.php?id=132189"]104*383^408249+1[/URL]

It is 1,054,591 digits :smile: and it enters at 449th largest prime :smile:[/QUOTE]
:bow wave::bow wave::party:

[QUOTE=KEP;574735]On March 28th at 09:44 local time, a dream came true :smile:

One of my Ryzen PC's found following prime:

[URL="https://primes.utm.edu/primes/page.php?id=132189"]104*383^408249+1[/URL]

It is 1,054,591 digits :smile: and it enters at 449th largest prime :smile:[/QUOTE]


Congratulations!
:bow:

Thanks guys :smile:

@Masser: There is 38 k's remaining, with k=2, 32 and 128 being tested to n=1M without a prime - this will be reflected in the update in approximately 3 weeks from now :smile:

18922*111^383954+1 found by marmot (785315 digits)

607*676^544517+1 found by 3DpNKyXhViXrNkzNVoTcy7VQKmKS (1540957 digits)


base S676 is proven

[QUOTE=rebirther;575052]607*676^544517+1 found by 3DpNKyXhViXrNkzNVoTcy7VQKmKS (1540957 digits)


base S676 is proven[/QUOTE]

Wow - congrats!

:banana:

[QUOTE=rebirther;575052]607*676^544517+1 found by 3DpNKyXhViXrNkzNVoTcy7VQKmKS (1540957 digits)

base S676 is proven[/QUOTE]


:bow wave:

[QUOTE=rebirther;575052]607*676^544517+1 found by 3DpNKyXhViXrNkzNVoTcy7VQKmKS (1540957 digits)


base S676 is proven[/QUOTE]


Well done!
Congratulations
:bow:

1261*988^246031+1 is prime at 736807 digits, which is 3x longer than the previous prime for this conjecture. Continuing my search on this base.

[QUOTE=rogue;577496]1261*988^246031+1 is prime at 736807 digits, which is 3x longer than the previous prime for this conjecture. Continuing my search on this base.[/QUOTE]


Nice find! :banana:


Don't forget to include CRUS in your top-5000 submissions. :smile:

[QUOTE=gd_barnes;577505]Nice find! :banana:

Don't forget to include CRUS in your top-5000 submissions. :smile:[/QUOTE]

I was going to create a new proof code, but wasn't clear how to add CRUS to it. If CRUS can be added to the code I used, that would be nice.

[QUOTE=rogue;577518]I was going to create a new proof code, but wasn't clear how to add CRUS to it. If CRUS can be added to the code I used, that would be nice.[/QUOTE]
You cannot add a project to an existing code. You will have to create a new code and have the prime transferred to it. To do this: (1) Create a code with all of the attributions of your current code plus CRUS as a project. (2) Email Prof. Caldwell at the top-5000 site to transfer the prime to it.

If you don't wish to do (2) I can take care of that part of it.

Here's a how to for creating a proof code with CRUS as the project: Start the process of creating a new proof code. When you get to this page:
[URL]https://primes.utm.edu/bios/newcode.php[/URL]

In addition to clicking on Jeane Penne's LLR in the middle of the page type "srsieve,CRUS" (without quotes) in the box towards the bottom of the page. Then submit the proof code.

That should do it.

[QUOTE=gd_barnes;577553]You cannot add a project to an existing code. You will have to create a new code and have the prime transferred to it. To do this: (1) Create a code with all of the attributions of your current code plus CRUS as a project. (2) Email Prof. Caldwell at the top-5000 site to transfer the prime to it.

If you don't wish to do (2) I can take care of that part of it.

Here's a how to for creating a proof code with CRUS as the project: Start the process of creating a new proof code. When you get to this page:
[URL]https://primes.utm.edu/bios/newcode.php[/URL]

In addition to clicking on Jeane Penne's LLR in the middle of the page type "srsieve,CRUS" (without quotes) in the box towards the bottom of the page. Then submit the proof code.

That should do it.[/QUOTE]

Since you are offering to have it transferred, would you mind doing so. :-)

The proof code stuff is a complete mess at the Top 5000. I wish it were more robust WRT selecting people, programs, and projects. So many are inaccurate and impossible to fix and just too much effort to create new ones.

[QUOTE=rogue;577563]Since you are offering to have it transferred, would you mind doing so. :-)

The proof code stuff is a complete mess at the Top 5000. I wish it were more robust WRT selecting people, programs, and projects. So many are inaccurate and impossible to fix and just too much effort to create new ones.[/QUOTE]

I echo your sentiments about the proof code process at top 5000 being very difficult to navigate.

I am fine Emailing Prof. Caldwell to transfer the prime to a new proof code. But you will have to create the new proof code and tell me what it is...or tell me what your ID and password are at top 5000 so that I can create it for you. :-)

You cannot change or have Prof. Caldwell change an existing proof code...to my knowledge anyway.

L5342

[QUOTE=rogue;577579]L5342[/QUOTE]

Request sent. I will edit this posting when it is done.

Edit: done

2636*138^469911+1 found by whizbang (1005557 digits)
15340*625^209640+1 found by Shaman (586133 digits)
17370*625^222563+1 found by Dirk Broer (622264 digits)
9574*625^292308+1 found by grcpool.com (817263 digits)

216*558^195427-1 found by [SG-FC] dingdong (536769 digits)

R650 is proven :)
 

Yesterday my "small Ryzen 3700x" start producing continuous beep, so PRP is found. Right now PRP is proven prime!
This is my second largest prime I ever found.


[URL="https://primes.utm.edu/primes/page.php?id=132360"]4*650^498101-1[/URL]

[QUOTE=pepi37;579849]Yesterday my "small Ryzen 3700x" start producing continuous beep, so PRP is found. Right now PRP is proven prime!
This is my second largest prime I ever found.


[URL="https://primes.utm.edu/primes/page.php?id=132360"]4*650^498101-1[/URL][/QUOTE]

What program was used? Is the machine overclocked?

[QUOTE=rogue;579860]What program was used? Is the machine overclocked?[/QUOTE]
Why it matters when prime is proven by Top 5000?
Prime95 , yes OC to 4GHz

[QUOTE=pepi37;579861]Why it matters when prime is proven by Top 5000?
Prime95 , yes OC to 4GHz[/QUOTE]

My bad. I hadn't realized that you had a typo in your original post, which was later fixed. I was confused.

Great find!

[QUOTE=rogue;579872]My bad. I hadn't realized that you had a typo in your original post, which was later fixed. I was confused.

Great find![/QUOTE]
No problem
Thanks for kind words

[QUOTE=pepi37;579849]Yesterday my "small Ryzen 3700x" start producing continuous beep, so PRP is found. Right now PRP is proven prime!
This is my second largest prime I ever found.


[URL="https://primes.utm.edu/primes/page.php?id=132360"]4*650^498101-1[/URL][/QUOTE]

A big congrats! Very nice find! :-)

:bow wave:

[QUOTE=gd_barnes;579882]A big congrats! Very nice find! :-)

:bow wave:[/QUOTE]


Thanks Gary!

[QUOTE=pepi37;579849]Yesterday my "small Ryzen 3700x" start producing continuous beep, so PRP is found. Right now PRP is proven prime!
...
[URL="https://primes.utm.edu/primes/page.php?id=132360"]4*650^498101-1[/URL][/QUOTE]

Not very surprising.

[QUOTE=R. Gerbicz;579909]Not very surprising.[/QUOTE]

Can you explain, why is not surprising?

[QUOTE=pepi37;579910]Can you explain, why is not surprising?[/QUOTE]

We are expecting that basically all of these (say >1000 digits) Prps are really primes, so not composite.

[QUOTE=R. Gerbicz;579911]We are expecting that basically all of these (say >1000 digits) Prps are really primes, so not composite.[/QUOTE]

In past, I read that many computers produced false positive primes when they are - 1. For now prime95 never failed on my machine. 😁

Strictly speaking it is [B]not [/B]UTM servers' job to _prove_ your PRP prime.
In fact, Caldwell (consequently) should be credited with proving this PRP prime. You should be credited at prptop Lifchitz' website, that would be correct.

It is the discoverer's burden to prove the PRP first, and only [B]after that[/B] submit to UTM.

Is it so hard to install LLR on your computer? :rolleyes:
[QUOTE=pepi37;579912]In past, I read that many computers produced false positive primes when they are - 1. [/QUOTE]
So, then, why do you submit a PRP (or possibly even a false positive) to UTM?
Instant gratification generation victim?

[QUOTE=Batalov;579913]Strictly speaking it is [B]not [/B]UTM servers' job to _prove_ your PRP prime.
In fact, Caldwell (consequently) should be credited with proving this PRP prime. You should be credited at prptop Lifchitz' website, that would be correct.

It is the discoverer's burden to prove the PRP first, and only [B]after that[/B] submit to UTM.

Is it so hard to install LLR on your computer? :rolleyes:

So, then, why do you submit a PRP (or possibly even a false positive) to UTM?
Instant gratification generation victim?[/QUOTE]


Language barrier for many times ( like this one)
I have LLR on my computer and I test and prove it is prime.

But UTM server has last word , not me or my computer :) ( that is what I learn from you Batalov, when I found first prime here, many years ago)

[QUOTE=pepi37;579924]Language barrier for many times ( like this one)
I have LLR on my computer and I test and prove it is prime.

But UTM server has last word , not me or my computer :) ( that is what I learn from you Batalov, when I found first prime here, many years ago)[/QUOTE]

LLR 3.8.24 can run PRP/GEC tests now, followed automatically by the standard primality proof on whatever turns up as a probable prime. You don't really need Prime95 for GEC anymore.

[QUOTE=Happy5214;579930]LLR 3.8.24 can run PRP/GEC tests now, followed automatically by the standard primality proof on whatever turns up as a probable prime. You don't really need Prime95 for GEC anymore.[/QUOTE]

I prefer prime95 over llr

170*709^183988-1 found by grcpool.com (524487 digits)

400*315^225179-1 found by Ralfy (562570 digits)

[URL="https://primes.utm.edu/primes/page.php?id=132445"]1620198 · 7^684923 - 1[/URL] (578834 digits)

144*471^218627-1 found by vaughan (584397 digits)

96*439^205245-1 found by Maurice Goulois (542355 digits)

968*837^183539-1 found by grcpool.com (536438 digits)

base S243:


4918*3^1169850+1 found by p3d-cluster (558164 digits)
13032*3^1031180+1 found by KySU (492003 digits)
18498*3^1235740+1 found by Luigi R. (589603 digits)
31924*3^1050325+1 found by grcpool.com (501137 digits)
30710*3^1074305+1 found by KySU (512579 digits)
34900*3^1080805+1 found by whizbang (515680 digits)
39636*3^1122080+1 found by grcpool.com (535373 digits)
39486*3^1177895+1 found by [AF] Skinny06 (562004 digits)
34398*3^1260170+1 found by Egon Olsen (601259 digits)
9760*3^1406070+1 found by Ralfy (670870 digits)
23492*3^1047860+1 found by grcpool.com-3 (499961 digits)
6414*3^1426625+1 found by whizbang (680677 digits)
31924*3^1428855+1 found bygrcpool.com-3 (681742 digits)
1018*3^1455600+1 found by grcpool.com (694501 digits)
25044*3^1464570+1 found by SeanHsu (698782 digits)
17616*3^1467400+1 found by Ralfy (700132 digits)
8658*3^1540430+1 found by Neriyah (734976 digits)
11996*3^1559395+1 found by grcpool.com (744025 digits)
14336*3^1563960+1 found by Neriyah (746203 digits)
33016*3^1696980+1 found by Tern (809670 digits)
38490*3^1709455+1 found by grcpool.com (815622 digits)
27602*3^1759590+1 found by vaughan (839543 digits)
14804*3^1778530+1 found by vaughan (848579 digits)
24704*3^1877135+1 found by grcpool.com (895626 digits)
32582*3^1901790+1 found by pixel1975 (907389 digits)
34202*3^1908800+1 found by 3yVfc2sXot5KWHfyytJ8xMf37KiZ (910734 digits)
38804*3^1913975+1 found by whizbang (913203 digits)

:bounce wave:

A tremendous load of top-5000 and top-3000 primes by SRBase! Great work BOINC!

This leaves us with only 8 top-3000 primes to go to hit our 2021 goal! :smile: