![]() |
![]() |
#1 |
Jul 2011
32×13 Posts |
![]()
I saw that nobody had used the coefficient k = 4191 for Riesel prime searching, so I decided to adopt it myself. I hope this is OK.
I solved for all primes k*b^n-1 for k = 4191 b = 2 n = 2 to 50000 Here are the 29 primes for n in that range: 55, 82, 117, 133, 146, 199, 214, 238, 299, 318, 386, 586, 678, 709, 791, 861, 901, 1069, 2178, 3622, 3694, 6950, 15575, 25237, 26022, 27030, 29982, 35741, 38755. I am testing the range 50000 - 100000 now. I would like to reserve this constant, k, if that is permissible. Thank you. |
![]() |
![]() |
![]() |
#2 |
Feb 2003
22×32×53 Posts |
![]()
Please note, that this sequence is already listed on kar_bon's pages with primes up to n=80000:
2, 7, 10, 11, 18, 55, 82, 117, 133, 146, 199, 214, 238, 299, 318, 386, 586, 678, 709, 791, 861, 901, 1069, 2178, 3622, 3694, 6950, 15575, 25237, 26022, 27030, 29982, 35741, 38755, 64046, 66671, 67634, 79778 Also note, that small primes are typically missed, either due to the sieve or due to limitations of the LLR/PRP code (in your case for n=2, 7, 10, 11, 18). For the small ones you might consider some computer algebra system (like Maxima) or just PARI/GP. Last fiddled with by Thomas11 on 2011-07-18 at 17:37 |
![]() |
![]() |
![]() |
#3 | |
Jul 2011
32·13 Posts |
![]() Quote:
|
|
![]() |
![]() |
![]() |
#4 |
Jul 2011
32×13 Posts |
![]()
OK then, back to the orphanage goes 4191!
Can I work on k = 8001 then? I see no results for that. And why are there two sets of pages, one not having been updated since 2007? Those out of date pages need to be taken down. |
![]() |
![]() |
![]() |
#5 | |
"Dave"
Sep 2005
UK
2·19·73 Posts |
![]() Quote:
k=4191 has been searched by me for n<80000 and n>500000. However, I have not searched between 80000 and 500000. You are more than welcome to fill the gap. |
|
![]() |
![]() |
![]() |
#6 | |
Jul 2011
11710 Posts |
![]() Quote:
Here is a screen shot of what I see. Unfortunately his pages are unable to be linked to results, there are no htmls for range results, you have to pull down a menu. Can you show me where 8001 is listed below? Why can't I see the results you are referring to? I am just interested in finding a constant that is unclaimed, and generating all of the primes for that constant. |
|
![]() |
![]() |
![]() |
#7 | |
"Lennart"
Jun 2007
25·5·7 Posts |
![]() Quote:
Go down on that page. Lennart |
|
![]() |
![]() |
![]() |
#8 | |
"Forget I exist"
Jul 2009
Dumbassville
100000110000002 Posts |
![]() Quote:
|
|
![]() |
![]() |
![]() |
#9 |
"Forget I exist"
Jul 2009
Dumbassville
26·131 Posts |
![]() |
![]() |
![]() |
![]() |
#10 |
Jul 2011
32×13 Posts |
![]()
I still don't see it when I bring up the list from the menu.
This is so frustrating! OK, I am taking the ridiculously large constant 11235813 since it is well known that (11235813 * 2^98) - 1 = 3560771273375535719079719333026332671 and that is prime! I hope nobody is claiming 1123581321. I will henceforth work on that constant until I can figure out why large blocks of k's are not being shown to me. |
![]() |
![]() |
![]() |
#11 |
"Curtis"
Feb 2005
Riverside, CA
467810 Posts |
![]()
SaneMur-
Lennart told you to scroll down on the page where you see 8145. I don't know why they are out of order, but the full list from 8001 starts after a selection of k's being tested by IM Gunn or one of our drives here at RPS. You are on the right page, you just aren't looking at the entire page. Every k to 10,000 is listed on his pages. Note if you pick one under 10,000, you can use the sieves from primegrid, which are vastly deeper than any sane person would ever achieve on his own. -Curtis |
![]() |
![]() |
![]() |
Thread Tools | |
![]() |
||||
Thread | Thread Starter | Forum | Replies | Last Post |
Two more Hilbert problems were solved... not | Batalov | Miscellaneous Math | 5 | 2018-09-22 20:14 |
roundoff = 0.224. Normal? Yes. [solved] | Fred | Software | 3 | 2016-02-05 00:01 |
Small script for primes (SOLVED) | pepi37 | Linux | 12 | 2015-05-22 01:32 |
(xy)^2 when x and y are powers of two is solved!! | f1pokerspeed | Puzzles | 6 | 2012-11-25 00:05 |
Certicom 109-bit challenge solved | ewmayer | Math | 2 | 2002-11-09 00:21 |