|
next PRP
411*2020^14877+1 tested to 17.8K, 17 k's remain. I expect this to be done within the week |
R2020 is complete to 30k.
Primes since 20k: 1607 20812 657 24848 1614 26578 1607 26836 1677 29619 1947 29789 6 primes for 5 k's. 42 k's remain. Work continues: the next sieve is at 2.5T, while 3 cores LLR in the 30-40k range. Anyone is welcome to test a particular k, or a range of n-values from my sieve. Please? |
R2020 is complete to 40k. Primes since 30k:
1550 33104 786 37452 582 38650 519 39728 38 k's remain. The sieve is at 5T, with 40k-50k assigned to 4 cores. Work available from 50k upward. |
[QUOTE=VBCurtis;534537]
Anyone is welcome to test a particular k, or a range of n-values from my sieve. Please?[/QUOTE] Ok, I'm in. Recently I've installed PRPNet and want to extensively test it. |
:tu: Excellent!
What range can I send you? There are 1400-1500 tests per n=1k range. Is 50k-60k a good place to start? Note that I decided to place one core on k=9 tests, so that k is complete to almost 100k and won't be included in the sieve file I post here. |
The power-of-2 bases are more interesting, should we extend the power-of-2 bases to 2^16?
Sierpinski: [CODE] base CK 2048 334 4096 1206 8192 83 16384 114 32768 10 65536 1221 [/CODE] Riesel: [CODE] base CK 2048 29 4096 5264 8192 28 16384 59 32768 10 65536 6015 [/CODE] |
[QUOTE=VBCurtis;535355]:tu: Excellent!
What range can I send you? There are 1400-1500 tests per n=1k range. Is 50k-60k a good place to start?[/QUOTE]Ok, looking forward to find 2-3 primes at this range. |
1 Attachment(s)
Attached is the R2020 sieve file from 50k to 100k. It is sieved to 5T depth.
I'm continuing to sieve, target 8-9T, so you should request a new file in 7-10 days if you decide to go higher than 60k. |
@sweety, R2048 has 2 k remaining, k=5 and k=11, both searched to very high limits over n=4M base 2 after accounting for the Riesel Sieve effort. Most other bases on your list have more k's remaining, all at similar limits based on the Riesel Sieve effort.
Also, S2020 update: k=474, 615, 684, 738, 874, 892 are at n=25K and released. No PRP for any of these k. |
[QUOTE=NHoodMath;535473]@sweety, R2048 has 2 k remaining, k=5 and k=11, both searched to very high limits over n=4M base 2 after accounting for the Riesel Sieve effort. Most other bases on your list have more k's remaining, all at similar limits based on the Riesel Sieve effort.
Also, S2020 update: k=474, 615, 684, 738, 874, 892 are at n=25K and released. No PRP for any of these k.[/QUOTE] Well, since these power-of-2 bases are searched to very high limits by Riesel/Proth Sieve effort, I think that CRUS can include them. Also, I think that CRUS can include the k's > CK for all k<=1024 for all Riesel/Sierpinski bases b<=32. (e.g. R8, R9, R14, S8, S14, these would be interesting bases, e.g. I already tested R9 for k<=1024, only k=386 and k=744 remain, both at n=25K with no primes found) |
sweety, CRUS does not intend any work on k's > CK because the project's goal is simply to solve the 1st conjecture for each individual base. If k's > CK were included, decisions would have to be made as to up to what limit to search these extra k's to, whether it should be k's up to the second conjecture or k's<1024 like you searched, etc.
The mainland already has enough work for people with the right resources to do for millions of years in the future. We simply do searches on these bases and k's either as fun side projects or as a way for people without as much CPU power to have something to run on their machines. |
next prp
189*2020^20878+1
363*2020^22046+1 |
1 Attachment(s)
Attached is the final sieve for R2020, sieved to 9T. The file covers n from 50k to 100k.
The desktop I was running this base on is overheating, so I haven't yet finished 40k-50k. |
I'm at ~55K, one prime so far for low weight k: 1296*2020^52931-1
|
Almost at 60K, no new primes. [B]VBCurtis[/B], there are no candidates for k=1968 in sieve file, did you knock this k out?
|
I did, found two primes for it. I did not report here because the machine that found them overheated, and hasn't been booted up successfully since so I don't have specific n values.
|
Sierp base 2020 complete to 25K. 21 k's at 10K - 6 k's found prime for 10K-25K = 15 k's remaining. Base released except k=12, 402, and 892. K's remaining:
12 138 255 259 291 390 402 430 471 474 615 684 738 874 892 |
[QUOTE=VBCurtis;536325]I did, found two primes for it. I did not report here because the machine that found them overheated, and hasn't been booted up successfully since so I don't have specific n values.[/QUOTE]
R2020 primes for 1968: 46193 and 48526. My desktop is functioning, but still runs hot. I'm slowly finishing to 50k on R2020. Likely another 4-6 days. |
Two more primes for R2020:
[CODE]419*2020^63826-1 776*2020^66346-1 [/CODE] I'll going to stop at n=70k. |
R2020 finally made it to 50k on my end, 70k including unconnected's work.
Primes from 40k-50k: 1968 46193 1035 47247 1968 48526 (bummer, repeat) There were 38 k's left at 40k. I took out two, while unconnected took out three. 33 k's remain at 70k. Not continuing at present; I have a couple other loose ends to finish up on other projects before I continue this effort. The sieve file is a few posts up in this thread if anyone wants to take on a 5k or 10k block. |
I'm stopped at n=70k, one more prime: 788*2020^67011-1
|
Whoops! "I'm going to stop" doesn't mean "I stopped". Whew, I'm glad you noticed my mistake, and also glad you found another prime!
|
R9 k=386 and 744 tested to n=25K, no primes found, see post [URL="https://mersenneforum.org/showpost.php?p=490301&postcount=663"]https://mersenneforum.org/showpost.php?p=490301&postcount=663[/URL]
S12 k<1143 (3rd CK) tested to 25K, see [URL="https://mersenneforum.org/showpost.php?p=490354&postcount=665"]https://mersenneforum.org/showpost.php?p=490354&postcount=665[/URL], these primes were found: 1057*12^690+1 1057*12^1072+1 1057*12^1522+1 563*12^4020+1 1052*12^5715+1 1057*12^6514+1 1057*12^6826+1 1057*12^7438+1 no primes found for k = 885, 911, 976, 1041 R12 k=1132 tested to n=21760, no primes (see post [URL="https://mersenneforum.org/showpost.php?p=490302&postcount=664"]https://mersenneforum.org/showpost.php?p=490302&postcount=664[/URL]), 1037*12^6281-1 is prime |
5 Attachment(s)
Update the status file for:
SR8, R9: k<=1024 S12: k<=1143 (the 3rd CK) R12: k<=1288 (the 3rd CK) SR8 skipped the cube k's and the k's having covering set {3, 5, 13} (i.e. for S8, k == 47, 79, 83, 181 mod 195; for R8, k == 14, 112, 116, 148 mod 195) SR9 skipped the square k's and the k's having covering set {2, 5} (i.e. k == 41, 49 mod 80) (this is for (k*b^n+-1)/gcd(k+-1,b-1), however, you can ignore the k's such that gcd(k+-1,b-1) is not 1, e.g. for S8, you can ignore the k's == 6 mod 7) |
[QUOTE=sweety439;552025]Update the status file for:
SR8, R9: k<=1024 S12: k<=1143 (the 3rd CK) R12: k<=1288 (the 3rd CK) SR8 skipped the cube k's and the k's having covering set {3, 5, 13} (i.e. for S8, k == 47, 79, 83, 181 mod 195; for R8, k == 14, 112, 116, 148 mod 195) SR9 skipped the square k's and the k's having covering set {2, 5} (i.e. k == 41, 49 mod 80) (this is for (k*b^n+-1)/gcd(k+-1,b-1), however, you can ignore the k's such that gcd(k+-1,b-1) is not 1, e.g. for S8, you can ignore the k's == 6 mod 7)[/QUOTE] Remain k's: S8: 256 (GFN, at n=(2^33-8)/3-1), 370 (extended, corresponding number should be divided by 7 to get a prime since 370*8^n+1 has trivial factor of 7, at n=10K), 467 (at n=833333 due to [URL="http://www.prothsearch.com/riesel1a.html"]http://www.prothsearch.com/riesel1a.html[/URL]) R8: 239 (extended, corresponding number should be divided by 7 to get a prime since 239*8^n-1 has trivial factor of 7, at n=10K), 247 (at n=76666 due to [URL="http://www.prothsearch.com/riesel2.html"]http://www.prothsearch.com/riesel2.html[/URL]), 757 (extended, corresponding number should be divided by 7 to get a prime since 757*8^n-1 has trivial factor of 7, at n=10K) R9: 386, 744 (both at n=25K) S12: 12 (GFN, at n=2^25-2), 885, 911, 976, 1041 (all k except k=12 at n=25K) R12: 1132 (at n=21760) |
4 Attachment(s)
These are the status for the first 4 conjectures for SR32 and SR128 (I only update the power-of-2 bases here, since they are more interesting, for more SR bases, see the files in post [URL="https://mersenneforum.org/showpost.php?p=552748&postcount=930"]https://mersenneforum.org/showpost.php?p=552748&postcount=930[/URL] and the GitHub page [URL="https://github.com/xayahrainie4793/first-4-Sierpinski-Riesel-conjectures"]https://github.com/xayahrainie4793/first-4-Sierpinski-Riesel-conjectures[/URL])
[CODE] base CK remain k S32 10, 23, 43, 56 4, 16 (proven if GFN are excluded) R32 10, 23, 43, 56 29 (at n=2M by CRUS search for R1024) S128 44, 85, 98, 173 16, 40, 47, 83, 88, 94, 122 R128 44, 59, 85, 86 46 [/CODE] |
[QUOTE=sweety439;552749]These are the status for the first 4 conjectures for SR32 and SR128 (I only update the power-of-2 bases here, since they are more interesting, for more SR bases, see the files in post [URL="https://mersenneforum.org/showpost.php?p=552748&postcount=930"]https://mersenneforum.org/showpost.php?p=552748&postcount=930[/URL] and the GitHub page [URL="https://github.com/xayahrainie4793/first-4-Sierpinski-Riesel-conjectures"]https://github.com/xayahrainie4793/first-4-Sierpinski-Riesel-conjectures[/URL])
[CODE] base CK remain k S32 10, 23, 43, 56 4, 16 (proven if GFN are excluded) R32 10, 23, 43, 56 29 (at n=2M by CRUS search for R1024) S128 44, 85, 98, 173 16, 40, 47, 83, 88, 94, 122 R128 44, 59, 85, 86 46 [/CODE][/QUOTE] Testing limits might be useful in your files. I assume you have checked for base 2 primes on [url]https://www.rieselprime.de/default.htm[/url] |
[QUOTE=henryzz;552782]Testing limits might be useful in your files. I assume you have checked for base 2 primes on [url]https://www.rieselprime.de/default.htm[/url][/QUOTE]
OK, but see the GitHub page [URL="https://github.com/xayahrainie4793/first-4-Sierpinski-Riesel-conjectures"]https://github.com/xayahrainie4793/first-4-Sierpinski-Riesel-conjectures[/URL], there are too many "NA" in these files, however I an give you the test limit for some bases: e.g. S4 for all k: 10K S7 for all k: 3K R7 for k == 1 mod 6: 3K R7 for other k: 15K (given using page [URL="https://www.rose-hulman.edu/~rickert/Compositeseq/"]https://www.rose-hulman.edu/~rickert/Compositeseq/[/URL]) S10 for k = 100: 2^31-3 S10 for k = 269: 100K S12 for k = 12: 2^25-2 S12 for other k: 25K R12 (only one k remain: 1132): 21760 S25 for k = 71 and k = 181: 10K S25 for k = 222: 350K (given by CRUS) SR26 for all k: 2K |
There are pages shown the status (including the test limit) for the conjectures of (k*b^n+-1)/gcd(k+-1,b-1) (+ for Sierpinski, - for Riesel) with bases 2<=b<=128 and b=256, 512, 1024
[URL="https://docs.google.com/document/d/e/2PACX-1vQvru05GPynoscjw69pkmzJkLpR9PNO6aQLoi5cYGkHYvpA_XVRbN4AN6Pz20yEylKMf2aM8UUJejDi/pub"]Sierpinski conjectures[/URL] [URL="https://docs.google.com/document/d/e/2PACX-1vSS0MZ5-obO4Ghr04s1XELgNY9PPfjJzbm9iuk5hwFVbQKOEaZ5IxKD9y2GQLvLce281JZE43XMbunQ/pub"]Riesel conjectures[/URL] Edit: the test limit for S10 k=100 is now 2^31-3 (2.147G), see [URL="http://www.prothsearch.com/GFN10.html"]http://www.prothsearch.com/GFN10.html[/URL] |
1 Attachment(s)
[QUOTE=sweety439;552095]Remain k's:
S8: 256 (GFN, at n=(2^33-8)/3-1), 370 (extended, corresponding number should be divided by 7 to get a prime since 370*8^n+1 has trivial factor of 7, at n=10K), 467 (at n=833333 due to [URL="http://www.prothsearch.com/riesel1a.html"]http://www.prothsearch.com/riesel1a.html[/URL]) R8: 239 (extended, corresponding number should be divided by 7 to get a prime since 239*8^n-1 has trivial factor of 7, at n=10K), 247 (at n=76666 due to [URL="http://www.prothsearch.com/riesel2.html"]http://www.prothsearch.com/riesel2.html[/URL]), 757 (extended, corresponding number should be divided by 7 to get a prime since 757*8^n-1 has trivial factor of 7, at n=10K) R9: 386, 744 (both at n=25K) S12: 12 (GFN, at n=2^25-2), 885, 911, 976, 1041 (all k except k=12 at n=25K) R12: 1132 (at n=21760)[/QUOTE] (370*8^8300+1)/gcd(370+1,8-1) is (probable) prime Update the correct file for S8 k<=1024 |
[URL="https://github.com/xayahrainie4793/all-k-1024"]https://github.com/xayahrainie4793/all-k-1024[/URL]
All k<=1024 for all bases 2<=b<=32 and b=64, 256, searched up to n=4096 |
1 Attachment(s)
Riesel base 2021, CK = 338, tested to n=2000
checked k=32, where n == 0 mod 5 is algebraic, k=32 does not make a full covering set with partial algebra factors |
Sweety-
You have been threatened with a ban from this forum for posting useless trivia (among many other annoying behaviors). "useless trivia", as one example: Work that can be computed so quickly that anyone else who cares about the work can do it so quickly themselves that they should not trust your work. You tested a base with a conjecture of 338 to n=2000? That took what, 3 minutes? It may have taken as long to type the commands to invoke the programs as it did to compute. That's the very definition of useless content. This is why Gary has asked you to no longer post on CRUS. If you continue to post (a) useless information or (b) on subfora where you have been asked to not post, you risk a ban. A concrete measure you can use: if you can compute the information in less than a CPU-week, you should not post it. You've used up your good grace from others with your tiny corrections of e.g. search limits or typos. Those posts aren't welcome either. You have a personal choice to make- stop posting noise, or lose your posting privileges. 95% of your posts waste the reader's time, and the mods are tired of having their time wasted by you. It's time to change your behavior. |
[QUOTE=sweety439;568634]Riesel base 2021, CK = 338, tested to n=2000
checked k=32, where n == 0 mod 5 is algebraic, k=32 does not make a full covering set with partial algebra factors[/QUOTE] I already had this one (R2021) searched to 13K, going to 25K rn (BTW I did finish those 3 k's on S2020 to n=100K, no primes) |
[QUOTE=VBCurtis;568669]Sweety-
You have been threatened with a ban from this forum for posting useless trivia (among many other annoying behaviors).[/QUOTE]Another behaviour that is not welcome: going out of your way to find numbers/sequences in base 36 that make naughty words. |
I have Sweety blocked and just delete all of his posts now without even knowing what they say. It makes my job a lot easier.
I will leave this one since it was responded to. Edit: Curtis, If you can ban Sweety from CRUS I would appreciate that. Thanks, Gary |
| All times are UTC. The time now is 09:00. |
Powered by vBulletin® Version 3.8.11
Copyright ©2000 - 2021, Jelsoft Enterprises Ltd.