![]() |
|
|
#331 |
|
May 2009
Russia, Moscow
2,593 Posts |
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. |
|
|
|
|
|
#332 |
|
May 2007
Kansas; USA
101×103 Posts |
Unconnected,
One new base per day please while I'm out of town as requested in the news thread. Thanks. Gary |
|
|
|
|
|
#333 | |
|
May 2007
Kansas; USA
101·103 Posts |
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 Last fiddled with by gd_barnes on 2010-04-23 at 10:51 |
|
|
|
|
|
|
#334 |
|
Quasi Admin Thing
May 2005
2·3·7·23 Posts |
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 ![]() But anyway, if you're interested, in my offer, let's discuss it further via e-mail. Regards Kenneth |
|
|
|
|
|
#335 | |
|
"Mark"
Apr 2003
Between here and the
18D016 Posts |
Quote:
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. Last fiddled with by rogue on 2010-04-23 at 12:44 |
|
|
|
|
|
|
#336 |
|
"Mark"
Apr 2003
Between here and the
24·397 Posts |
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. |
|
|
|
|
|
#337 | |
|
Quasi Admin Thing
May 2005
11110001102 Posts |
Quote:
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 ![]() Take care Kenneth |
|
|
|
|
|
|
#338 | |
|
"Mark"
Apr 2003
Between here and the
24·397 Posts |
Quote:
|
|
|
|
|
|
|
#339 | |
|
Quasi Admin Thing
May 2005
11110001102 Posts |
Quote:
![]() 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 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 |
|
|
|
|
|
|
#340 | |
|
"Mark"
Apr 2003
Between here and the
24·397 Posts |
Quote:
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. |
|
|
|
|
|
|
#341 | |
|
Quasi Admin Thing
May 2005
2·3·7·23 Posts |
Quote:
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 ![]() 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 ![]() 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 |
|
|
|
|
![]() |
Similar Threads
|
||||
| Thread | Thread Starter | Forum | Replies | Last Post |
| Riesel base 3 reservations/statuses/primes | KEP | Conjectures 'R Us | 1107 | 2021-07-26 18:37 |
| Bases 501-1030 reservations/statuses/primes | KEP | Conjectures 'R Us | 3913 | 2021-07-26 09:58 |
| Bases 6-32 reservations/statuses/primes | gd_barnes | Conjectures 'R Us | 1397 | 2021-07-25 07:07 |
| Bases 101-250 reservations/statuses/primes | gd_barnes | Conjectures 'R Us | 905 | 2021-07-18 16:55 |
| Bases 33-100 reservations/statuses/primes | Siemelink | Conjectures 'R Us | 1691 | 2021-07-06 18:50 |