mersenneforum.org Untested Riesel conjectures sorted by conjecture
 User Name Remember Me? Password
 Register FAQ Search Today's Posts Mark Forums Read

 2010-04-20, 08:18 #12 10metreh     Nov 2008 2·33·43 Posts Aha. Seems there is actually a bug in covering.exe. Will check my other results. Edit: Since there was only one value (the one mentioned in my previous post) which came anywhere near 2^60, I've checked that one and assumed the rest were OK. Last fiddled with by 10metreh on 2010-04-20 at 08:36
2010-04-20, 08:42   #13
gd_barnes

May 2007
Kansas; USA

10,223 Posts

Quote:
 Originally Posted by rogue AFAIAC, keep your results to yourself or publish them elsewhere. I don't recall anyone expressing interest in seeing more conjectures added to this project. There is enough work for this project to keep everyone (currently involved) busy for decades.
More like for millions of years.

And I thought I was harsh. Spoken like I was thinking though.

10metreh, what's the bug you uncovered in covering.exe?

2010-04-20, 08:45   #14
10metreh

Nov 2008

91216 Posts

Quote:
 Originally Posted by gd_barnes 10metreh, what's the bug you uncovered in covering.exe?
I didn't find it, it was the bug mentioned in the thread kar_bon gave me the link to where bad results can appear when kbound*primebound is very large. None of my new results were affected by it because they were too small.

2010-04-20, 08:46   #15
gd_barnes

May 2007
Kansas; USA

10,223 Posts

Quote:
 Originally Posted by 10metreh With what parameters was Riesel k=280 (the one with the highest conjectured k) tested (assuming covering.exe was used)? I have managed to reduce the conjecture to k=253971311388192, although that one will still not be proved for a long time! Oddly, the original conjectured k of 513613045571841 didn't show up at all in my run of covering 144 280 -1 100000 1000000000000000. BTW: no conjectures up to 1200 are larger than that (the largest I've found so far is 1150 481388992590).
Very interesting. Have you determined a covering set for R280 k=253971311388192? Or is this the covering.exe bug that you are talking about?

I know Robert did the original conjectured k's on all of the bases and I think he used his own program. I have found them to be extremely accurate so far but I haven't messed around with conjectures > 5M.

Gary

 2010-04-20, 08:52 #16 gd_barnes     May 2007 Kansas; USA 10,223 Posts Hum. R280 k=253971311388192 can't have a covering set: 253971311388192*280^4-1 -and- 253971311388192*280^10-1 are both prime! Also, there are too many large factors for it to be the S280 conjecture. So much for that one. Did you have a typo in your k?
2010-04-20, 08:55   #17
10metreh

Nov 2008

91216 Posts

Quote:
 Originally Posted by gd_barnes Very interesting. Have you determined a covering set for R280 k=253971311388192? Or is this the covering.exe bug that you are talking about?
Yes, that's the bug. It has a prime early on, as you found.

Of course there may still be a smaller Riesel k with a ridiculous period or large factor. Very hard to tell with these larger ones.

Last fiddled with by 10metreh on 2010-04-20 at 08:55

 2010-04-20, 09:17 #18 henryzz Just call me Henry     "David" Sep 2007 Cambridge (GMT/BST) 22×1,433 Posts if you go to his website then you will find that there is also a program called bigcovering this might have a bugfix for this. it might be slower though and that might be why he has kept the programs separate
 2010-04-20, 12:40 #19 10metreh     Nov 2008 2·33·43 Posts That does seem to have a bugfix: R280 works out fine. It also verifies R1150 k=481388992590 (which does have a covering set). Last fiddled with by 10metreh on 2010-04-20 at 12:40
2010-04-21, 14:49   #20
KEP
Quasi Admin Thing

May 2005

2×7×67 Posts

Quote:
 Originally Posted by 10metreh That does seem to have a bugfix: R280 works out fine. It also verifies R1150 k=481388992590 (which does have a covering set).
Why don't you reserve some work for b<=1024, maybe start up your own base, or use the script in the "starting new bases" thread, to do some work on untested ranges for the base 3, 7 & 15 conjectures. It would be need to see all b<=100 tested to at least n=25K. I'm not sure how many ressources you have to put into the effort, but a Quad can test a base 3 range of 50M k's (a 100M range) to n=1K in about a 24h period. So you can see, even doing the R3 to n=1K will take about 2 years. So are you up for it?

KEP

 2010-05-10, 13:48 #21 MyDogBuster     May 2008 Wilmington, DE 22·23·31 Posts Audit complete for the 1st and 2nd posts. R986 was missing with a ck of 8. Last fiddled with by MyDogBuster on 2010-05-10 at 13:49
 2010-11-10, 14:01 #22 rogue     "Mark" Apr 2003 Between here and the 2·2,971 Posts I took each of the conjectures where the conjectured k>10000 and ran a range of 1000 up to n=500 with the script to get an idea as to the difficulty to proving them. The following list is an extrapolation of that data, showing the number of expected remaining k per conjecture at n=500. This list only shows those for which the expected remaining k < 10000. Code: Base Conjectured k Expected Remaining k 991 11358 148 897 19308 154 918 11946 191 270 21681 195 418 11733 223 382 13404 228 640 10349 269 750 27353 274 973 21914 307 565 20598 309 348 18496 314 693 14922 343 228 16718 368 882 25606 384 568 19347 387 592 17196 396 658 22407 403 858 24053 409 943 18822 414 355 46190 416 477 14102 423 282 19139 440 757 27666 443 215 15358 461 403 24744 470 675 37816 492 723 12852 514 555 58202 524 442 54047 540 507 11812 555 810 35683 642 682 40979 656 553 31854 669 490 48051 673 207 38572 694 745 31706 698 598 43728 700 717 30514 702 262 27351 711 738 13738 728 880 48720 731 150 49074 736 787 27332 793 862 26417 819 292 34682 832 840 84608 846 940 36929 849 772 27054 893 445 43338 953 708 41121 987 225 168032 1008 742 21546 1013 903 24746 1039 393 11358 1045 498 96306 1059 1023 68394 1094 291 16410 1198 193 80802 1212 877 50654 1266 871 16460 1267 431 15380 1307 576 17798 1335 303 85368 1366 460 56243 1406 613 34692 1422 223 54704 1477 808 59058 1595 466 21450 1609 807 32824 1641 607 51584 1651 616 23447 1665 351 27708 1690 145 257324 1801 190 626861 1881 672 41440 1906 895 152774 2139 575 77600 2173 591 30820 2188 255 205022 2255 430 45152 2303 646 30410 2311 448 131556 2500 768 55367 2547 306 39295 2593 297 130076 2602 396 41672 2750 786 37209 2791 997 101526 2843 537 113788 2958 627 129182 2971 312 173401 3121 323 93896 3192 1018 111284 3227 775 172368 3620 222 88530 3895 996 52840 3910 295 664484 3987 336 63018 4096 388 205391 4108 822 156369 4222 310 363869 4366 612 105437 4428 495 117150 4452 411 60254 4579 432 192596 4622 421 73640 4713 660 322567 4839 838 180384 5051 513 221706 5099 357 584078 5257 397 172134 5680 1005 244960 5879 283 218042 5887 751 85682 6169 451 89610 6183 606 74660 6271 975 282032 6769 771 83954 6968 856 108467 8243 171 112790 8346 595 291890 8465 247 469184 8914 728 212722 9360 732 211836 9533 936 100260 9725 820 390795 9770 226 158447 9982 Last fiddled with by MyDogBuster on 2013-01-16 at 09:47 Reason: R600

 Thread Tools

 Similar Threads Thread Thread Starter Forum Replies Last Post Siemelink Conjectures 'R Us 6 2020-08-05 00:11 rogue Conjectures 'R Us 26 2018-01-03 19:51 jasong Conjectures 'R Us 39 2008-04-06 00:21 jasong Programming 11 2007-10-15 20:48 jasong Information & Answers 1 2006-10-06 06:17

All times are UTC. The time now is 05:34.

Fri Oct 23 05:34:13 UTC 2020 up 43 days, 2:45, 0 users, load averages: 1.56, 1.59, 1.50

Powered by vBulletin® Version 3.8.11
Copyright ©2000 - 2020, Jelsoft Enterprises Ltd.

This forum has received and complied with 0 (zero) government requests for information.

Permission is granted to copy, distribute and/or modify this document under the terms of the GNU Free Documentation License, Version 1.2 or any later version published by the Free Software Foundation.
A copy of the license is included in the FAQ.