![]() |
Hello all,
This thread is long and slightly confusing. What is the current state of the project? Can I contribute? If so; how? I've done some sieving and PRP-3 checks before I found you here. |
[QUOTE=lorgix;233846]What is the current state of the project?
[/QUOTE] The results for k*b^b+1 and k*b^b-1 and 1<=k<=10000 and 1<=b<=1000 are given on my page. No further work done so far. |
[QUOTE=kar_bon;233847]The results for k*b^b+1 and k*b^b-1 and 1<=k<=10000 and 1<=b<=1000 are given on my page.
No further work done so far.[/QUOTE] Ok, so it'd make sense for me to continue sieving 10499<k<11501, 1049<b<1151 (+/-1), right? (The range has >12500 candidates without divisors <50,000,000) |
Ah, the old project...
-1 side is done? Okay; I think I might work to 1200. |
1 Attachment(s)
The following should be all primes in the range;
10499<k<11501, 1049<b<1151 (+/-1) [CODE]11180*1055^1055+1 11230*1058^1058+1 11427*1058^1058+1 11374*1060^1060+1 11058*1070^1070+1 11310*1070^1070+1 11383*1070^1070+1 11466*1071^1071+1 10665*1074^1074+1 10568*1077^1077+1 11419*1082^1082+1 11150*1083^1083+1 10905*1094^1094+1 11214*1102^1102+1 10818*1106^1106+1 10659*1110^1110+1 11191*1112^1112+1 10941*1116^1116+1 10944*1118^1118+1 10714*1119^1119+1 10752*1119^1119+1 11393*1122^1122+1 10627*1126^1126+1 11190*1132^1132+1 10665*1134^1134+1 11478*1146^1146+1 11290*1150^1150+1 10621*1050^1050-1 10642*1050^1050-1 10532*1051^1051-1 11294*1052^1052-1 11004*1057^1057-1 10883*1060^1060-1 10782*1063^1063-1 11247*1064^1064-1 11262*1065^1065-1 11201*1082^1082-1 11362*1092^1092-1 10545*1094^1094-1 11144*1095^1095-1 10713*1098^1098-1 10896*1113^1113-1 11254*1116^1116-1 11054*1117^1117-1 11353*1122^1122-1 11340*1125^1125-1 10526*1129^1129-1 11186*1130^1130-1 11270*1132^1132-1 10560*1133^1133-1 11454*1133^1133-1 11156*1137^1137-1 10728*1139^1139-1 11120*1146^1146-1 11309*1148^1148-1[/CODE] |
I worked from 1 to 10k for k, for the bases, I worked until 1372.
|
[QUOTE=3.14159;240386]I worked from 1 to 10k for k, for the bases, I worked until 1372.[/QUOTE]
Nice, and no overlap then. What would you suggest I do next of this sort, if anything? |
1 Attachment(s)
[QUOTE=lorgix;240350]The following should be all primes in the range;
10499<k<11501, 1049<b<1151 (+/-1) [/QUOTE] I've just noticed your searched ranges, but I can't update the tables on my pages with these data in an easy way. I would be more necessary to search for other ranges (see picture). I've not yet got results from 3.14159 of his searched range, so please coordinate both searches for next work to do. |
1 Attachment(s)
[QUOTE=lorgix;240458]Nice, and no overlap then. What would you suggest I do next of this sort, if anything?[/QUOTE]
Just collect for 1-1200 for the base values, using k between 10001 and 11500, if you want to expand for the k-ranges. And, to appease Karsten; [ATTACH]5964[/ATTACH] 1001-1360 covered. I haven't collected for a long time. Be sure to double-check, to ensure that I did not miss any primes. |
I think I should get started on arithmetic progression collection;
I think I'll get started on k * (n! * p(n)#) + 1, for some values of n. I'll do the usual range, 1 to 10000 for k, 1 to 1000 for n. n = 1000 will be about 5960 digits. (I'm up to 67, so I've collected every prime in the ranges I searched for, up to 227 digits.) Charles; If you'd like, you could contribute the smallest k for which k * (n! * p(n)#) + 1 is prime. |
[QUOTE=3.14159;240576]Charles; If you'd like, you could contribute the smallest k for which k * (n! * p(n)#) + 1 is prime.[/QUOTE]
That would be 1. |
| All times are UTC. The time now is 06:20. |
Powered by vBulletin® Version 3.8.11
Copyright ©2000 - 2021, Jelsoft Enterprises Ltd.