S398 k=8 conjecture proven and added to the pages.

This one took a fairly large prime to finish it off:
7*398^17472+1

Reserving Sierp 401 & 469 as new to n=25K

Riesel Base 363
 

Riesel Base 363
Conjectured k = 64
Covering Set = 7, 13
Trivial Factors k == 1 mod 2(2) and k == 1 mod 181(181)

Found Primes: 30k's - File attached

Remaining k's: 1k - Tested to n=25K
34*363^n-1

Base Released

Riesel Base 376
 

Riesel Base 376
Conjectured k = 144
Covering Set = 13, 29
Trivial Factors k == 1 mod 3(3) and k == 1 mod 5(5)

Found Primes: 76k's - File attached

Trivial Factor Eliminations: 66k's

Conjecture Proven

Nice high ck proven with just scripting

Sierp Base 401
 

Sierp Base 401
Conjectured k = 68
Covering Set = 3, 67
Trivial Factors k == 1 mod 2(2) and k == 4 mod 5(5)

Found Primes: 25K's - File attached

Remaining k's: 1k - Tested to n=25k
20*401^n+1

Trivial Factor Eliminations: 7k's

Base Released

Sierp Base 469
 

Sierp Base 469
Conjectured k = 46
Covering Set = 5, 47
Trivial Factors k == 1 mod 2(2) and k == 2 mod 3(3) and k == 12 mod 13(13)

Found Primes: 13k's - File attached

Trivial Factor Eliminations: 9k's

Conjecture Proven

Riesel bases 350 and 437
 

Primes found:

2*350^14-1
3*350^1-1
4*350^1-1
5*350^40-1
6*350^1-1
7*350^9-1
8*350^10-1
9*350^5-1
10*350^1-1
11*350^12-1
12*350^4-1
13*350^1-1

2*437^2-1
4*437^1-1
6*437^1-1
8*437^4-1
10*437^3-1
12*437^5-1

With a conjectured k of 14, both of these are proven.

Riesel base 500, k=166
Remaining k's:
38*500^n-1
53*500^n-1
74*500^n-1
82*500^n-1
107*500^n-1
Trivially factors: k=1

Base completed to 25K and released, primes attached.

Riesel base 308
 

Hi folks,

I've run the numbers on Riesel base 308. There are 7 k's left at n = 25,000:
7*308^n-1
43*308^n-1
52*308^n-1
59*308^n-1
67*308^n-1
74*308^n-1
89*308^n-1

Regards, Willem.

Riesel base 492
 

Hi folks,

I've run the numbers on Riesel base 492. There is one k remaining at n = 25,000:
23*492^n-1.

Cheers, Willem.

Riesel base 473
 

Primes found:

2*473^660-1
4*473^13-1
6*473^1-1
8*473^200-1
10*473^1-1
12*473^48-1

With a conjectured k of 14, this conjecture is proven.

[quote=Siemelink;211366]Hi folks,

I've run the numbers on Riesel base 308. There are 7 k's left at n = 25,000:
7*308^n-1
43*308^n-1
52*308^n-1
59*308^n-1
67*308^n-1
74*308^n-1
89*308^n-1

Regards, Willem.[/quote]

The conjecture is k=104 and you show it as k=101 with primes up to k=100. I'll hold off on showing anything on the pages other than a reservation until I get them all.

Once again, it would really help if you would simply attach the pl_primes.txt, pfgw-primes.log, or pfgw.log file to your posting. I have processes in place to sort them by n-value for posting on the pages. For these keyed in sheets, I have to do manual manipulation to get them in the order that I need plus do a primality check on them since they are not coming directly from any software that I am aware of.

If they are on a remote machine, one of the 2 above files can be Emailed to yourself or to me. That's what I do when I'm out of town and have to copy a file from one computer to another. I can do that using a free remote access service.


Thank you,
Gary

[quote=Siemelink;211368]Hi folks,

I've run the numbers on Riesel base 492. There is one k remaining at n = 25,000:
23*492^n-1.

Cheers, Willem.[/quote]

You have the conjecture at k=59. It is actually k=86. Many primes are missing. Please rerun. I'll show it as reserved by you to n=25K.

One more thing: Both of these were posted in the base 101-250 thread and I had to move them. Please make sure they are in the correct thread. Thanks.

Argh, for some reason when I picked up the conjectures I mangled a few. I knew about the 308 equals 104, but manage to post the old version.

Sorry for the trouble, I'll go about and repair it.

Willem.

New bases S335 and S440 k=8 conjectures are complete to n=25K.

Only k=4 remains on both of them.

Riesel base 333, k=502
Remaining k's:
14*333^n-1
16*333^n-1
302*333^n-1

Trivially factors: k=84,250,416

Base completed to 25K and released, primes attached.

Riesel base 362
 

Primes found:

2*362^4-1
3*362^15-1
4*362^1-1
5*362^2-1
6*362^26-1
8*362^28-1
9*362^1-1

k=7 remains. This has been tested to n=25000 and is being released.

Riesel base 347, k=28
Primes:
2*347^522-1
4*347^3-1
6*347^1-1
8*347^4-1
10*347^1-1
12*347^5-1
16*347^9-1
18*347^10-1
20*347^2-1
24*347^384-1
26*347^18-1
14*347^4616-1

Remaining k's:
22*347^n-1

Base completed to 25K and released.

New base S482 k=8 conjecture is complete to n=25K. Only k=4 remains.

Riesel bases 305 and 407
 

Primes found:

2*305^2-1
4*305^3-1
6*305^2-1
8*305^2-1
10*305^1-1
12*305^1-1
14*305^2-1

2*407^10-1
4*407^1-1
6*407^1-1
10*407^345-1
12*407^5-1
14*407^452-1

k=8 has trivial factors. With a conjectured k of 16, both of these conjectures are proven.

[LEFT]Reserving Riesel 337 and 423 as new to n=25K
[/LEFT]

Riesel base 286
 

Primes found:

[code]
2*286^1-1
3*286^1-1
5*286^1-1
8*286^1-1
9*286^163-1
12*286^3-1
14*286^1-1
15*286^1-1
17*286^1-1
18*286^1-1
23*286^1-1
24*286^1-1
27*286^2-1
29*286^1-1
30*286^3-1
32*286^1-1
33*286^1-1
35*286^1-1
38*286^1-1
42*286^1-1
44*286^1-1
45*286^4-1
47*286^1-1
48*286^6-1
50*286^3-1
53*286^6-1
54*286^1-1
57*286^1-1
59*286^2-1
60*286^1-1
62*286^2-1
63*286^3-1
65*286^2-1
68*286^1-1
69*286^2-1
72*286^8-1
74*286^1-1
75*286^2-1
78*286^1-1
80*286^2-1
[/code]

The conjectured k is 83. All other k have trivial factors. The conjecture is proven.

I don't think that I've seen another conjecture with so many small n.

Riesel base 426
 

Primes found:

[code]
2*426^2-1
3*426^1-1
4*426^3-1
5*426^1-1
7*426^60-1
8*426^1-1
9*426^1-1
10*426^1-1
12*426^29-1
13*426^2-1
14*426^2-1
15*426^1-1
17*426^4-1
19*426^1-1
20*426^2-1
22*426^1-1
23*426^2-1
24*426^1-1
25*426^13-1
27*426^4-1
28*426^1-1
29*426^49-1
30*426^4-1
32*426^6-1
33*426^1-1
34*426^6-1
37*426^1-1
38*426^1-1
39*426^3-1
40*426^19-1
42*426^1-1
43*426^3-1
44*426^1-1
45*426^13-1
47*426^1-1
48*426^2-1
49*426^1-1
50*426^5-1
53*426^15-1
54*426^1-1
55*426^162-1
57*426^1-1
58*426^2-1
59*426^5-1
60*426^8-1
[/code]

The conjectured k is 62. The other k have trivial factors. This conjecture is proven.

Reserving Sierp 338 and 343 as new to n=25K

Reserving Riesel 253 and 268 as new to n=25K

[QUOTE=Siemelink;211366]Hi folks,

I've run the numbers on Riesel base 308. There are 7 k's left at n = 25,000:
7*308^n-1
43*308^n-1
52*308^n-1
59*308^n-1
67*308^n-1
74*308^n-1
89*308^n-1

Regards, Willem.[/QUOTE]
Here is the missing bit:
101*308^90-1
102*308^4-1
103*308^1-1

Regards, Willem.

Riesel Base 337
 

Riesel Base 337
Conjectured k = 378
Covering Set = 5, 13, 41
Trivial Factors k == 1 mod 2(2)
k == 1 mod 3(3)
k == 1 mod (7(7)

Found Primes: 103k's - File attached

Remaining k's: 3k's - Tested to n=25K
38*337^n-1
194*337^n-1
222*337^n-1

k=324 proven composite by partial algebraic factors

Trivial Factor Eliminations: 81k's

Base Released

Reserving Riesel 387 & 390 as new to n=25K

R361
 

Done with R361 to 25K.
For a CK of 8870, very few (15) [I]k[/I]'s remain (of which three are tested to higher limits for R19).
Results emailed to Gary. Base released.

Riesel base 443, k=28

Primes:
2*443^12-1
4*443^3-1
6*443^1-1
8*443^416-1
10*443^3-1
12*443^3-1
16*443^165-1
20*443^6-1
22*443^7-1
24*443^1-1
26*443^2-1

Trivially factors: k=14, 18
Base proven.

Riesel Base 253
 

Riesel Base 253
Conjectured k = 1904
Covering Set = 5, 13, 43
Trivial Factors k == 1 mod 2(2) and k == 1 mod 3(3) and k == 1 mod 7(7)

Found Primes: 537k's - File attached

Remaining k's: 4's - Tested to n=25K
408*253^n-1
1650*253^n-1
1652*253^n-1
1854*253^n-1

Trivial Factor Eliminations: 408k's

MOB Eliminations: 2k's
506
1518

Base Released

S383 is at n=25K, 50 k's remaining. Continuing to n=100K, is going to e-mail residuals and remaining k's aswell as other script created files in a short while to Gary.

KEP

Sierp Base 343
 

Sierp Base 343
Conjectured k = 1936
Covering Set = 5, 13, 43
Trivial Factors k == 1 mod 2(2) and k == 2 mod 3(3) and k == 18 mod 19(19)

Found Primes: 598k's - File attached

Remaining k's: 11k's - File attached - Tested to n=25K

k=216 proven composite by full algebraic factors

Trivial Factor Eliminations: 357k's

Base Released

[quote=MyDogBuster;212781]Sierp Base 343
Remaining k's: 11k's - File attached - Tested to n=25K

...k=216 proven composite by full algebraic factors
[/quote]
And so do k=64 and k=1000. :ermm:

I would like to advance S343 to 50K.

Riesel base 447, k=148.
Primes attached.

Remaining k's:
78*447^n-1
118*447^n-1
146*447^n-1

Base completed to 25K and released.

Riesel bases 455, 413, and 340
 

I haven't posted any in a few days, so in keeping with an average of one per day...

Primes found:

2*455^2-1
4*455^3-1
6*455^1-1
8*455^2-1
10*455^1-1
12*455^8-1
14*455^20-1
16*455^5-1
18*455^198-1

With a conjectured k of 20, this conjecture is proven.

2*413^6-1
4*413^23-1
6*413^1-1
8*413^4-1
10*413^1-1
12*413^2-1
14*413^20-1
16*413^1-1
18*413^1-1
20*413^4-1

With a conjectured k of 22, this conjecture is proven.

2*340^60-1
3*340^1-1
5*340^1-1
6*340^1-1
8*340^1-1
9*340^3-1
11*340^1-1
12*340^1-1
14*340^1-1
15*340^1-1
17*340^1-1
18*340^22-1
20*340^12-1
21*340^2-1
23*340^3-1
24*340^4-1
26*340^1-1
27*340^2-1
29*340^1-1
30*340^2-1

The other k have trivial factors. With a conjectured k of 32, this conjecture is proven.

Riesel base 353, k=58.
Primes attached.

1k's remain: 52*353^n-1
Trivially factors: k=12,34,56.

Base completed to 25K and released.

Riesel base 373, k=74.
Primes:
2*373^3-1
6*373^1-1
8*373^4-1
12*373^3-1
14*373^8-1
20*373^1-1
24*373^1-1
26*373^1-1
30*373^15-1
36*373^5-1
38*373^1-1
42*373^3-1
44*373^1-1
48*373^1-1
50*373^10-1
54*373^4-1
56*373^1-1
60*373^11-1
62*373^2-1
66*373^31-1
68*373^14-1
72*373^3-1

1k's remain: 18*373^n-1
Trivially factors: 13 k's.

Base completed to 25K and released.

Riesel base 401, k=68.
Primes:
2*401^112-1
4*401^3-1
8*401^140-1
10*401^77-1
12*401^2-1
14*401^2-1
18*401^2-1
20*401^10-1
22*401^1-1
24*401^1-1
28*401^21-1
30*401^61-1
32*401^2-1
34*401^1-1
40*401^3-1
42*401^7-1
44*401^6-1
48*401^6-1
50*401^2-1
52*401^7-1
54*401^2-1
58*401^15-1
60*401^2-1
62*401^8-1
64*401^23-1

1k's remain: 38*401^n-1
Trivially factors: 7 k's.

Base completed to 25K and released.

Unconnected,

One new base per day please while I'm out of town as requested in the news thread. Thanks.


Gary

[quote=rogue;212831]I haven't posted any in a few days, so in keeping with an average of one per day...

Primes found:

2*455^2-1
4*455^3-1
6*455^1-1
8*455^2-1
10*455^1-1
12*455^8-1
14*455^20-1
16*455^5-1
18*455^198-1

With a conjectured k of 20, this conjecture is proven.

2*413^6-1
4*413^23-1
6*413^1-1
8*413^4-1
10*413^1-1
12*413^2-1
14*413^20-1
16*413^1-1
18*413^1-1
20*413^4-1

With a conjectured k of 22, this conjecture is proven.

2*340^60-1
3*340^1-1
5*340^1-1
6*340^1-1
8*340^1-1
9*340^3-1
11*340^1-1
12*340^1-1
14*340^1-1
15*340^1-1
17*340^1-1
18*340^22-1
20*340^12-1
21*340^2-1
23*340^3-1
24*340^4-1
26*340^1-1
27*340^2-1
29*340^1-1
30*340^2-1

The other k have trivial factors. With a conjectured k of 32, this conjecture is proven.[/quote]


This doesn't work. I never said anything about averages. 1 max per day please. I was beginning to feel a little relief from not so many being posted and then I'm unloaded on here right before a very busy weekend where I'll have no time for updates. Had you posted one per day, I could have kept up. Taken to extreme, you could hold 200 of them and then post them all 200 days from now. The idea is to not back me up please.

I'm getting close to stopping adding any new bases to the pages for 3-6 months. From my perspective, they are becoming completely pointless, especially the small ones. The only reason I did the Sierp k=8 conjectures was to slowly finish off what KEP had started and at least somewhat bring them up closer to the Riesel side.

I have an idea. Since I believe you said you've already proven a gob of bases that you are hold off posting at the moment, how about creating a web page that shows them all in a format similar to the ones that I do? That would be helpful. If fully correct, I may be able to cut-and-paste them to mine.


Gary

If you would like Gary, I wouldn't mind helping you create the HTML code, for the unstarted bases. If you would like that, you can e-mail me the details of what part of HTML you would like for me to create, and what information you would like to have embedded in the cells of the tables, in order for you to accept it. Maybe this can help you, and too be honest I wouldn't mind using some time on creating the HTML code, such that you only need to COPY+PASTE whenever a new base is started, and then add the nescessary information for top10 primes and k's remaining.

I suggest that for bases with k>1M, it should be safe to create the HTML sites like we know them for Riesel base 3, where you only will have to add the k's remaining and the starting aswell as update date :smile:

But anyway, if you're interested, in my offer, let's discuss it further via e-mail.

Regards

Kenneth

[QUOTE=gd_barnes;212922]This doesn't work. I never said anything about averages. 1 max per day please.[/QUOTE]

I can abide by that.

I have about 60 proven, but not posted. Most of the remaining are on the Sierpinski side. I'll take a look at your HTML and see what I can do. That would certainly make both of us happy. For me, it means less posting. For you, using cut and paste will save you a lot of time.

But if you accept KEP's help, then maybe I could just pass my results to him and he could assist you more directly in keeping the HTML up to date.

Riesel base 371
 

Primes found:

2*371^8-1
4*371^1-1
8*371^2-1
10*371^1-1
12*371^1-1
14*371^2-1
18*371^3-1
20*371^44-1
22*371^1-1
24*371^2-1
28*371^111-1
30*371^24-1

The other k have trivial factors. With a conjectured k of 32, this conjecture is proven.

[QUOTE=rogue;212931]I can abide by that.

I have about 60 proven, but not posted. Most of the remaining are on the Sierpinski side. I'll take a look at your HTML and see what I can do. That would certainly make both of us happy. For me, it means less posting. For you, using cut and paste will save you a lot of time.

But if you accept KEP's help, then maybe I could just pass my results to him and he could assist you more directly in keeping the HTML up to date.[/QUOTE]

Rogue, if you could send me the proven conjectures, I'll work them into the HTML code. I just realized, that most of the HTML coding on the main site, is just about Copy+Paste, of the HTML code for each untested bases on the Rielse side, to the Sierpinski side, and then of course "just" change the conjecture, the covering set and the trvial factors. But a smart thing is that the trivial factors is the same on both sides, so all Gary has to add, once I complete the HTML, nothing later than next weekend, is to add the primes to the new bases currently untested and add algebraric factors. But if you could send me the proven conjectures (add Gary as cc please) then I'll show them as proven in the HTML coding.

And Gary, now I'm taking a week of my time, creating all the basic HTML for the Riesel, Sierpinski side, aswell the remaining reservations HTML, so please hold back on doing your own HTML work, since there is no reason we are doing double efforts on that kind of work, and just await that I send you the HTML coding and then copy+paste my HTML code.

The code I'm working from, is by the way an exact copy+paste of the current way that your HTML code is designed, so it should be easy for you to understand, what kind of information to put where. But again, those that I recieve as proven, I'll of course have them shown as proven in the HTML codes :smile:

Take care

Kenneth

[QUOTE=KEP;212955]Rogue, if you could send me the proven conjectures, I'll work them into the HTML code. I just realized, that most of the HTML coding on the main site, is just about Copy+Paste, of the HTML code for each untested bases on the Rielse side, to the Sierpinski side, and then of course "just" change the conjecture, the covering set and the trvial factors. But a smart thing is that the trivial factors is the same on both sides, so all Gary has to add, once I complete the HTML, nothing later than next weekend, is to add the primes to the new bases currently untested and add algebraric factors. But if you could send me the proven conjectures (add Gary as cc please) then I'll show them as proven in the HTML coding.[/QUOTE]

You've got mail! I did not cc Gary. I suspect he has enough to deal with.

[QUOTE=rogue;212960]You've got mail! I did not cc Gary. I suspect he has enough to deal with.[/QUOTE]

Thanks for your mails Rogue, I'll download the data sometime this weekend, first I'll prepare and complete the Riesel side, and then I'll start preparing the Sierpinski side :smile:

I'll of course, add those bases that you send me, as complete, and add the primes to the HTML code. But again I can't promise to have anything usefull completed before next weekend :smile: and as mentioned, I'll take the Riesel side first (since it appears that there is most activity there) and then I'll do the Sierpinski side.

Take care

Kenneth

[QUOTE=KEP;212962]Thanks for your mails Rogue, I'll download the data sometime this weekend, first I'll prepare and complete the Riesel side, and then I'll start preparing the Sierpinski side :smile:

I'll of course, add those bases that you send me, as complete, and add the primes to the HTML code. But again I can't promise to have anything usefull completed before next weekend :smile: and as mentioned, I'll take the Riesel side first (since it appears that there is most activity there) and then I'll do the Sierpinski side.[/QUOTE]

I'm in no hurry for them to be posted, but I suppose I could send the list to Gary so that he can remove them from the "Untested Sierpinski" thread.

If you have a Windoze box with Excel, it should be possible to put all of the data into a spreadsheet and then use a VB script to generate the HTML. With the script it would be possible to put data into multiple cells in the spreadsheet then combine them into one cell in the HTML.

Writing such as script would take some time, but for maintenance of the HTML it should be huge time saver long term. I use this method on ProthSearch to generate the tables. Granted that is far easier than what is needed on this project. For ProthSearch a hundred lines of VB script generates thousands of lines of HTML.

If you are interested (and Gary doesn't object), I could help you with such a script.

[QUOTE=rogue;212966]I'm in no hurry for them to be posted, but I suppose I could send the list to Gary so that he can remove them from the "Untested Sierpinski" thread.

If you have a Windoze box with Excel, it should be possible to put all of the data into a spreadsheet and then use a VB script to generate the HTML. With the script it would be possible to put data into multiple cells in the spreadsheet then combine them into one cell in the HTML.

Writing such as script would take some time, but for maintenance of the HTML it should be huge time saver long term. I use this method on ProthSearch to generate the tables. Granted that is far easier than what is needed on this project. For ProthSearch a hundred lines of VB script generates thousands of lines of HTML.

If you are interested (and Gary doesn't object), I could help you with such a script.[/QUOTE]

It sounds nice with such a script. I'm not sure you can make it in time for my posting next weekend (or sooner), but for future updates, I'm sure Gary at least would like it. I know not much about using vbscript in a spreadsheet, but if it can update the tables so there is no flaws, and very little time is used, then it deffinently is worth looking into.

I think that it will be a good idea to send the list to Gary, such that no other start these bases, since I'll (even though I have to do it manually) add them in the Sierpinski code.

To be honest, I found out, that I could save tons of typing, by using a spreadsheet to create the main code regarding the 499 Riesel codes, and since most of the Riesel bases can be copy pasted to the Sierpinski side, only very little effort is needed compared to what I initially had to do :smile:

If you can make a VB script, that can create the sub-pages (i.e. like R3, S3 and other conjectures with >25 k's remaining), then I'll not make those subpages, since it will require quite a lot of work/processes (even though I only have to change the base and type "save as"), that it would be need to avoid :smile:

But how fast Rogue could you potentially have such a vbscript working?
Can you make a vbscript that can create a new HTML file for different bases like those subpages that we know from R3? (and how fast, you think)?

Take care

Kenneth

[QUOTE=KEP;212970]It sounds nice with such a script. I'm not sure you can make it in time for my posting next weekend (or sooner), but for future updates, I'm sure Gary at least would like it. I know not much about using vbscript in a spreadsheet, but if it can update the tables so there is no flaws, and very little time is used, then it deffinently is worth looking into.

I think that it will be a good idea to send the list to Gary, such that no other start these bases, since I'll (even though I have to do it manually) add them in the Sierpinski code.

To be honest, I found out, that I could save tons of typing, by using a spreadsheet to create the main code regarding the 499 Riesel codes, and since most of the Riesel bases can be copy pasted to the Sierpinski side, only very little effort is needed compared to what I initially had to do :smile:

If you can make a VB script, that can create the sub-pages (i.e. like R3, S3 and other conjectures with >25 k's remaining), then I'll not make those subpages, since it will require quite a lot of work/processes (even though I only have to change the base and type "save as"), that it would be need to avoid :smile:

But how fast Rogue could you potentially have such a vbscript working?
Can you make a vbscript that can create a new HTML file for different bases like those subpages that we know from R3? (and how fast, you think)?[/QUOTE]

I am uncertain of the effort, thus make no promises. Gary told me in the past that it would be too hard to do and he might be right. Only by trying will I know. There are a number of intricacies with the data that will make such a script difficult to write. I'll try to grab some time this weekend to work on it.

I've sent the list to Gary.

Riesel base 433, k=92.
Primes attached.

Remaining k's:
6*433^n-1

Trivially factors: 15 k's
Base completed to 25K and released.

[quote=KEP;212923]If you would like Gary, I wouldn't mind helping you create the HTML code, for the unstarted bases. If you would like that, you can e-mail me the details of what part of HTML you would like for me to create, and what information you would like to have embedded in the cells of the tables, in order for you to accept it. Maybe this can help you, and too be honest I wouldn't mind using some time on creating the HTML code, such that you only need to COPY+PASTE whenever a new base is started, and then add the nescessary information for top10 primes and k's remaining.

I suggest that for bases with k>1M, it should be safe to create the HTML sites like we know them for Riesel base 3, where you only will have to add the k's remaining and the starting aswell as update date :smile:

But anyway, if you're interested, in my offer, let's discuss it further via e-mail.

Regards

Kenneth[/quote]

What you're offering takes very little time off of what I have to do. It's easy to create the boxes and list the base using Microsoft Front Page. That's nothing at all. Let me give you an idea of everything I do for new bases:

1. Do the easy HTML part of copying the boxes and showing the base on both the conjectures and reservations pages.
2. Factor b and b+1 to properly check and possibly analyze algebraic factors.
3. If Sierp, check for GFN primes.
4. Pull up Robert's sheet to get the conjecture and covering set. (I don't take people's word for that.)
5. Factor b-1 to get the correct trivial factors.
6. Save off the primes.
7. Sort the primes descending by n, format them for the pages, and list them. (I now have an automated spreadsheet that does this somewhat quickly.)
8. If applicable save off the results.
9. If applicable, add the base to the 1k thread. Also sieve the k to get the correct weight.
10. Remove the base from the untested bases thread.
11. Follow up with someone if there is an error or not all of the information is listed. (Quite common)


Can you guys see why even for easy proven bases without algebraic factors, this can average 10 mins. per base? Throw in a new base that has 1 k remaining, has algebraic factors, and has results to save off and you can be talking nearly 30 mins. Check out the recent R243. Batalov only reserved it. He hadn't searched it yet. It took me 30-35 mins. to get it listed correctly on the pages. Check it out and you'll see why.

It's not just the HTML. Getting the "HTML construct" for each base is easy. Listing and verifying that all of the information is correct is not easy and adding to that updating various threads makes it downright time-consuming.

I think you've probably already seen my PM response already where I allude to the fact that what is needed is far more effort than what you are anticipating. I've had people do the HTML for me before. Ultimately it took me longer. Why? Because sometimes it wasn't right and I still needed to do a lot more than just update the web pages.

So, if you or Ian (as he has offered) is willing to do all of the above for bases 513-1024, then let me know. Otherwise, I would appreciate it if people would stop searching a ton of small-conjectured bases and wanting to dump them on me. Your CPU time would be much better spent on smaller bases with larger conjectures. Also, I think it's only fair to leave some of the small conjectures for newer people as they come in.

BTW, on your k=8 proven Sierp conjectures that you dumped on me from way back, that was what I was using to post them 2 a day for a while. I just searched the ones with one k remaining to n=25K; proving a few more. So your effort did not go to waste there. I only did it for 2 reasons: (1) So your effort wasn't wasted. (2) To "catch it up" somewhat with the Riesel side. But...I have no intention of doing such an effort for CK=10 or 12 or 14 or whatever on the Sierp side. I made that exception once.

For now, if people want to post 1 new base < 512 per day, I'm fine with that but like I said in the other thread, I/we still need to think about how bases > 512 should be handled in the future.


Gary

I just now had time to read most of the posts in this thread.

So how are you going to do this Kenneth? The pages are dynamic and being updated constantly. Are you only going to send a page of proven bases that you and Mark have worked on or are you going to incorporate them in the existing pages? You can't do the latter.

You said that the k's with trivial factors are the same for Riesel and Sierp. That is incorrect so you need to make sure you understand what the difference is. Will you be listing GFns that don't have primes on the Sierp bases? How will you make that determination? Will you only be listing the proven bases? If not, it's possible for the Sierp side to have algebraic factors also. Will you know how to check for them? The covering set can be different for the 2 sides even if the conjecture/base is the same. Are you checking Robert's sheet for that? If the primes have the same n-value, are you sorting them descending by k within the n-value so that the largest one is listed first?

Regardless, this does not change anything regarding bases > 512. The project as it is currently designed is way too big. We need to work our way slowly upwards.


Gary

[QUOTE]1. Do the easy HTML part of copying the boxes and showing the base on both the conjectures and reservations pages.
2. Factor b and b+1 to properly check and possibly analyze algebraic factors.
3. If Sierp, check for GFN primes.
4. Pull up Robert's sheet to get the conjecture and covering set. (I don't take people's word for that.)
5. Factor b-1 to get the correct trivial factors.
6. Save off the primes.
7. Sort the primes descending by n, format them for the pages, and list them. (I now have an automated spreadsheet that does this somewhat quickly.)
8. If applicable save off the results.
9. If applicable, add the base to the 1k thread. Also sieve the k to get the correct weight.
10. Remove the base from the untested bases thread.
11. Follow up with someone if there is an error or not all of the information is listed. (Quite common)


So, if you or Ian (as he has offered) is willing to do all of the above for bases 513-1024, then let me know.[/QUOTE]

I still volunteer. I do most of that on my bases anyway now. I, like you, ALSO double check things like covering sets and CK's. Just so that everyone knows before hand, I will not open up 513-1024 to an uncontrolled assault on the new bases. Even though I probably have more time that Gary does to do this stuff, I also have a life and I also have over 70 cores that I manage. Don't know what limitations I can handle but it won't be much higher that what is in place now. Getting this stuff done quickly is not as important to me as getting it done correctly.

[QUOTE=gd_barnes;213436]I just now had time to read most of the posts in this thread.

So how are you going to do this Kenneth? The pages are dynamic and being updated constantly. Are you only going to send a page of proven bases that you and Mark have worked on or are you going to incorporate them in the existing pages? You can't do the latter.

You said that the k's with trivial factors are the same for Riesel and Sierp. That is incorrect so you need to make sure you understand what the difference is. Will you be listing GFns that don't have primes on the Sierp bases? How will you make that determination? Will you only be listing the proven bases? If not, it's possible for the Sierp side to have algebraic factors also. Will you know how to check for them? The covering set can be different for the 2 sides even if the conjecture/base is the same. Are you checking Robert's sheet for that? If the primes have the same n-value, are you sorting them descending by k within the n-value so that the largest one is listed first?

Regardless, this does not change anything regarding bases > 512. The project as it is currently designed is way too big. We need to work our way slowly upwards.


Gary[/QUOTE]

Answering you questions as raised:

1. I'm not going to do it, since I can't do much of the 11 checkpoints that you do, and I also got the impression that it was the HTML part that irritated you, but since that is not the case, I'm not going to do any further on that subject.

2. This is almost obvious, that I'm not going to update the HTML, I only offered to do the initial and the main HTML, and nothing further. I can still do that, if you wan't to, however it sounds like it is the most easy part of the maintenance.

3. Regarding the trivil factors, I do understand, but I may not have been as clear as you would have liked. According to what you've previously told me, all k's where b-1 mod primebase = 0, has following trivial factors:

on the riesel side: k = = 1 mod primebase (primebase)
on the sierpinski side: k = = primebase-1 mod primebase (primebase)

so in total it would have been a question of doing only 168 search and replace on the sierpinski code, once you have the completed Riesel code, where 1 is replaced with primebase-1. If the above is wrong, then others might have the trivial factors wrong also, cause that was the explanation I got in a thread a long time ago.

4. No, no GFN's

6. No I would also be listing the HTML coding for the none proven bases, such that you should just copy+paste it to the HTML file that you shows the conjectures on.

7. I've never had any luck on getting the site you referred to for checking for algebraric factors to work, so NO I would not be checking for those. Also I remember a while back, that it was stated that it was only the Riesel side that had algebraric factors. This sound like it has changed, since at least S63 had algebraric factors on 2 of its k's.

8. I'm checking Roberts list for both the conjecture and the correct covering set, so it should be okay and good to use.

9. And YES I would of course be sorting them such that the highest prime is listed first and the smallest prime is listed last.

Hope this got it all. But to sum up, I think you'll be better of letting Ian do the work, because I only offered to do the initial HTML coding and since I only have internet connection a few hours each week, it will be a problem to make it through your 11 checkpoints without people having to wait weeks or months to see their work listed on your site. So in short terms, I'm not continuing the HTML creation nor am I going to work on any HTML or base additions. So I'm sticking with the 3 reservations I have for now.

Take care

Kenneth

reserving riesel 258
4 ks remaining at 2.5k

Riesel 367
 

Reserving Riesel 367 as new to n=25K

I'm working with R500 (done to 50K, continuing to 100K).
107*500^30954-1 is prime!

Riesel 268
 

Riesel Base 268
Conjectured k = 1344
Covering Set = 5, 17, 269
Trivial Factors k == 1 mod 3(3) and k == 1 mod 89(89)

Found Primes: 865k's - File attached

Remaining: 17k's - File attached - Tested to n=25K

Trivial Factor Eliminations: 457k's

MOB Eliminations: 3k's
536
804
1340

Base Released

[quote=henryzz;213554]reserving riesel 258
4 ks remaining at 2.5k[/quote]
that 4 was including the conjecture k:blush: so 3
i have found two primes since:
14*258^2624-1
22*258^8471-1
so just k=6 remaining
edit:
i am at n=27k

Riesel Base 367
 

Riesel Base 367
Conjectured k = 620
Covering Set = 7, 13, 23, 619
Trivial Factors k == 1 mod 2(2) and k == 1 mod 3(3) and k == 1 mod 61(61)

Found Primes: 199k's - File attached

Remaining: Tested to n=25K
114*367^n-1
344*367^n-1
456*367^n-1
530*367^n-1

Trivial Factor Eliminations: 106k's

Base Released

[quote=Batalov;212785]And so do k=64 and k=1000. :ermm:[/quote]

Omission on my part on the pages. I've been so used to doing the Riesel side where b==(1 mod 3) has k==(1 mod 3) with a trivial factor of 3 so I inadvertantly omitted those k's==(1 mod 3).

So...9 k's are remaining on S343 at n=25K.

[quote=henryzz;213700]that 4 was including the conjecture k:blush: so 3
i have found two primes since:
14*258^2624-1
22*258^8471-1
so just k=6 remaining
edit:
i am at n=27k[/quote]

So I guess you're gonna make me search it to n=2500 to get all of the primes, eh? :-(

Please people, post all of the info. that I need for the pages. Thank you.

This isn't directed at you David but another pet peave is when a big prime or several (kind of) big primes are posted, the search depth for the other k's isn't listed. If that isn't posted, I can't update the last status date of the remaining k's. It's best if the search depth of remaining k's is >= to all primes on the base unless it is being searched by k instead of n-value; otherwise stating that xx # of primes remaining at n=xxK isn't quite accurate because larger primes have been found.

[quote=gd_barnes;213823]So I guess you're gonna make me search it to n=2500 to get all of the primes, eh? :-(

Please people, post all of the info. that I need for the pages. Thank you.

This isn't directed at you David but another pet peave is when a big prime or several (kind of) big primes are posted, the search depth for the other k's isn't listed. If that isn't posted, I can't update the last status date of the remaining k's. It's best if the search depth of remaining k's is >= to all primes on the base unless it is being searched by k instead of n-value.[/quote]
really it was the reservation i was posting
i was going to post the results when i was finished
here are the files
my current testing limit on k=6 is n=75k

[quote=henryzz;213825]really it was the reservation i was posting
i was going to post the results when i was finished
here are the files
my current testing limit on k=6 is n=75k[/quote]

When you post just a couple of primes and nothing else other than a search depth, I don't know what you expect me to show on the pages. It would be inconsistent to show only 2 primes.

Is it your preference that I just ignore your status in this kind of situation? If so, that is not a problem. But if not, I'll need at least the top 10 primes.

I guess I make the assumption that people are expecting their status to be shown on the pages within a few days of when they post it so I follow up to get any missing info.

Regardless, thanks for the primes.


Gary

[quote=gd_barnes;213830]When you post just a couple of primes and nothing else other than a search depth, I don't know what you expect me to show on the pages. It would be inconsistent to show only 2 primes.

Is it your preference that I just ignore your status in this kind of situation? If so, that is not a problem. But if not, I'll need at least the top 10 primes.

I guess I make the assumption that people are expecting their status to be shown on the pages within a few days of when they post it so I follow up to get any missing info.

Regardless, thanks for the primes.


Gary[/quote]
feel free to ignore them
i just post early so that others don't do the same work

Reserving R281 and R463 to 25K.

Gary, occasionally I have spare time to run several new CRUS bases. As long as I only post the results and primes of those searches 1 per day, is it ok if I reserve several in one day?

Sierpinski 259
 

With k=64 still remaining, Sierpinski base 259 has been extended from 25K to 50K. Base released. Residues attached.

Reserving Sierpinski base 328, one k-value remaining, k=27. Extending from 25K to 50K.

[quote=unconnected;213856]Reserving R281 and R463 to 25K.[/quote]

Unconnected,

Please only 1 new base per day. That's a permanent reduction from the previous 2 per day. I'll clarify this once more:

This refers to reservations of new bases. But if people just post the primes/k's remaining on a new base without reserving it, that also counts as a new base reservation in a day.

If you want to search 100 bases, you need to reserve them 1 a day for 100 days. If you want, you can do that and then post all 100 base's primes and k's remaining in 1 day. Obviously that's not ideal and would still annoy me somewhat but the "construct" of the base would already be in place on the pages and I won't complain. I would have already analyzed all pertinate info. that takes a little while; algebraic factors, GFN's without a prime, k's with trivial factors, k's that might have primes from other bases (such as base 6 primes that correspond to base 36), etc.

The idea here is to continually discourage the searching of new small-conjectured bases because it is not the direction that the project is intended for at this point.

[quote=henryzz;213888]Gary, occasionally I have spare time to run several new CRUS bases. As long as I only post the results and primes of those searches 1 per day, is it ok if I reserve several in one day?[/quote]


See the above. No, that is not OK. You can post as many results and primes as you want on any day. You can post tons of them as long as they are not for new bases. Just do not reserve NEW bases more than one per day.

This is intended for many people here: What's up with this anyway? Why the fascination with new easy bases? It takes little effort to prove easy bases and shows little. Can someone please enlighten me? I still don't get it.

How about a new recommended effort: Whenever you have small snippets of CPU time, please consider starting the sieving of some conjectures with 1-2 k's remaining and eventually forward me the sieve file for posting on the pages when you feel it is near a reasonable depth (or even before so that I can coordinate having it further sieved). Maybe we'll eventually get a drive going where we search a bunch of 1, 2, and 3 k's remaining bases all together.


Gary

[quote=paleseptember;213916]With k=64 still remaining, Sierpinski base 259 has been extended from 25K to 50K. Base released. Residues attached.

Reserving Sierpinski base 328, one k-value remaining, k=27. Extending from 25K to 50K.[/quote]

Hi paleseptember,

Thanks for the great work on extending the 1k remaining bases to n=50K. I noticed your pattern of going right up the bases 1 at a time on each side (Riesel and Sierp) for the ones that were unreserved and only searched to n=25K. Great idea and what the thread was intended for.

If that is what you are doing, don't forget Sierp base 230. :smile: It is the lowest unreserved Sierp base that has only the problematic k=4 remaining. A full 10 Sierp bases have only k=4 remaining so it's nice if we can eliminate one. I'm sure we'll find more bases where only k=4 remains also.


Gary

Riesel 423
 

Riesel Base 423
Conjectured k = 1536
Covering Set = 5, 29, 53
Trivial Factors k == 1 mod 2(2) and k == 1 mod 211(211)

Found Primes: 744k's - File attached

Remaining k's: 17k's - File attached - Tested to n=25K

k=900 proven composite by partial algebraic factors

Trivial Factor Eliminations: 4k's

MOB Eliminations:
846

Base Released

riesel 260
primes:
[code]
2*260^120-1
3*260^2-1
4*260^1-1
5*260^2-1
6*260^1-1
7*260^825-1
9*260^1-1
10*260^2103-1
11*260^4-1
12*260^1-1
13*260^3-1
14*260^4-1
16*260^1-1
17*260^6-1
18*260^1-1
19*260^9-1
20*260^326-1
21*260^9-1
23*260^12-1
24*260^12-1
25*260^7-1
26*260^100-1
27*260^1-1
[/code]
trivial:
[code]
1
8
15
22
[/code]

Riesel base 281, k=328.
Primes attached.

Remaining k's:
38*281^n-1
112*281^n-1
170*281^n-1
272*281^n-1
314*281^n-1

Trivially factors: 51 k's
Base completed to 25K and released.

Riesel Base 387
 

Riesel Base 387
Conjectured k = 98
Covering Set = 5, 17, 19
Trivial Factors k == 1 mod 2(2) and k == 1 mod 193(193)

Found Primes: 48k's - File attached

Conjecture Proven

I have completed testing the remaining riesel bases 250-300 with a CK<1000 to 25k(just not posted yet cause of the limit)
if someone tests 273 and 277 to 25k then the limit on the riesel side can be increased to 300k
I will post the next base tonight(266 i think)
I am willing to continue and do the serp side from 250-300 with a CK<1000

[quote=henryzz;214134]I have completed testing the remaining riesel bases 250-300 with a CK<1000 to 25k(just not posted yet cause of the limit)
if someone tests 273 and 277 to 25k then the limit on the riesel side can be increased to 300k
I will post the next base tonight(266 i think)
I am willing to continue and do the serp side from 250-300 with a CK<1000[/quote]

Sounds great.

Riesel base 463, k=668.
Primes attached.

Remaining k's:
216*463^n-1
356*463^n-1

Trivially factors: 160 k's
Base completed to 25K and released.

Riesel base 266
 

Riesel base 266, k=88.
Primes attached.

Remaining k's:
64*266^n-1

Base completed to 25K and released.

Sierp 328
 

I, ahem, have just realised that I've been testing Riesel 328, not Sierp 328. So, starting again.

I will be extending S328 from 25K to 50K, there is one k remaining, k=27.

Riesel Base 499
 

Riesel Base 499
Conjectured k = 2354
Covering Set = 5, 13, 61
Trivial Factors k == 1 mod 2(2) and k == 1 mod 3(3) and k == 1 mod 83(83)

Found Primes: 738k's - File attached

Remaining k's: 33k's - File attached - Tested to n=25K

k=144, 324, 1764, 2304 Proven composite by partial algebraic factors

Trivial Factor Eliminations: 401k's

Base Released

Riesel 343
 

Reserving R343 as new to n=25K

Riesel base 275, k=22.
Primes attached.

Remaining k's:
4*275^n-1
16*275^n-1

Base completed to 25K and released.

Riesel 390
 

Riesel Base 390
Conjectured k = 137
Covering Set = 17, 23
Trivial Factors k == 1 mod 389(389)

Found Primes: 134k's - File attached

k=16 proven composite by partial algebric factors

Conjecture Proven

Riesel base 290, k=98.
Primes attached.

Remaining k's:
19*290^n-1
64*290^n-1
71*290^n-1
81*290^n-1

Base completed to 25K and released.

Riesel 469
 

Riesel Base 469
Conjectured k = 516
Covering Set = 5, 47
Trivial Factors k == 1 mod 2(2) and k == 1 mod 3(3) and k == 1 mod 13(13)

Found Primes: 154k's - File attached

Remaining k's: Tested to n=25K
336*469^n-1
422*469^n-1
474*469^n-1

k=324 proven composite by partial algebraic factors

Trivial Factor Eliminations: 99k's

Base Released

This concludes the factor 5's with b= 4 mod 5 with 4 exceptions.

R124 CK = 3,730,449
R399 CK = 1,558,133,564
R624 CK = 569,819
R799 CK = 1,885,767,686,976

If anyone has 25 or 30 years to spare, R799 might be fun. :no:

Sierp 463
 

Reserving Sierp 463 as new to n=25K

Sierp base 263 taken to n=25K and released.
The conjectured k is 10 (covering set {3, 11}).
Just one k left with no primes:
8*263^n+1

The primes are:
2*263^957+1
4*263^50+1
6*263^1+1

Edit: k weight = 366 (a toughie)

Serp base 260, ck=28
Base proven.
Primes attached

Sierp 328
 

Extended Sierpinski 328 from n=25K to 50K, k=27 remains.
Residues attached, base released.

Now the rules are changed I can post these.
S274, CK=21, Base proven.
S285, CK=12, Base proven.
S296, CK=10, Base proven.
Primes attached.
If you need anything else I can post it later.

[quote=henryzz;214511]Now the rules are changed I can post these.
S274, CK=21, Base proven.
S285, CK=12, Base proven.
S296, CK=10, Base proven.
Primes attached.
If you need anything else I can post it later.[/quote]

Thanks David. Looks good. If you want, you don't have to include the trivial k's and GFN's. We don't really need them.

...glad to let Ian take these now. :smile:

[QUOTE]..glad to let Ian take these now. :smile:[/QUOTE]

Great job David. Just what we need to see. :tu:

Another lot. Last for at least a couple days.
S258, CK=36, Base proven.
S264, CK=54, Two ks remaining.
S266, CK=88, One k remaining.
Primes attached.
Bases tested to 25k and released.

An easy one:
S362, CK=10, proven.
Just one base, so here are the primes:
2*362^15+1
3*362^1+1
4*362^30+1
5*362^1+1
6*362^9+1
7*362^6+1
8*362^1+1
9*362^1+1

Great to see the Sierp side getting worked on now. It definitely needed some work.