![]() |
![]() |
#243 | |
"Serge"
Mar 2008
Phi(4,2^7658614+1)/2
9,901 Posts |
![]() Quote:
|
|
![]() |
![]() |
![]() |
#244 | |
Sep 2002
Database er0rr
102348 Posts |
![]() Quote:
|
|
![]() |
![]() |
![]() |
#245 |
Mar 2006
Germany
296710 Posts |
![]()
After years of work from RieselSieve and further testing/sieving/double checking by PrimeGrid there are currently 44 k-values left for which no prime k*2^n-1 was found yet.
After three primes found by Ryan Propper this year for the Riesel problem and a post from him at the PG forum, which says he's "doing some solo hunting" work for 12M<=n<=15M (but not explicitly given which k-values), PrimeGrid seems stopped the search for those 3 found k-values according to their status page showing they stopped checking at n~11.5M. So this will leave a range of uncertainty if there eventually exists a smaller prime than those found ones. Open questions: - Will PG check the missing ranges? - Is Ryan Propper testing further ranges/k-values? If so, which ones? Before this is cleared, the Riesel problem still stay at 47 open k-values left to prove the problem and I think neither Wilfrid Keller nor any serious prime hunter will rest until this inconsistency is resolved. To all: please comunicate your search and make them available to avoid duplicate work. |
![]() |
![]() |
![]() |
#246 | |
"Serge"
Mar 2008
Phi(4,2^7658614+1)/2
9,901 Posts |
![]() Quote:
But a simple question arises - can these three k values be Riesel numbers? They cannot. Then why is it relevant how big the witness primes are? Does this conjecture need two witness primes - i.e. these known ones, and the slightly smaller ones? It does not. Am I missing something? |
|
![]() |
![]() |
![]() |
#247 |
Mar 2019
3·97 Posts |
![]()
These are both your opinions, and the former is clearly false.
|
![]() |
![]() |
![]() |
#248 |
"Alexander"
Nov 2008
The Alamo City
3×52×11 Posts |
![]()
The Riesel problem, by definition, is proving whether 509,203 is the smallest Riesel number. These 3 k's, with prime n's now known, are no longer relevant for that problem. They cannot be the smallest Riesel number. While it would be useful to know the smallest primes for each k, this is not directly related to the Riesel problem as defined. There are 44 k's left in the Riesel problem, corresponding to the 44 Riesel k's less than 509,203 with no primes known.
|
![]() |
![]() |
![]() |
#249 |
Mar 2006
Germany
3·23·43 Posts |
![]()
I've updated the Wiki page with those not-PG-found-primes, unreserved them, so no longer listed in their project page, but still left a note for those 3 k-values.
Sure the Riesel problem is to find any n-value of any of the remianing k-values to prove the conjecture. But from beginning the project every real primesearcher like Keller or Gallot were anxious to know the lowest n-value. This also prevents to fill in the missing value for k=2293 in this OEIS sequence, because this lists only the lowest n. Because I could not determine the date when PG stopped the search for those values, I took the 2021-05-01 and the max-n value of the search from their status page. |
![]() |
![]() |
![]() |
#250 |
Mar 2019
3·97 Posts |
![]()
It does not help your arguments to claim that you are a "real" primesearcher (sp) and others are not, whatever that means.
|
![]() |
![]() |
![]() |
#251 |
Mar 2006
Germany
3·23·43 Posts |
![]()
I've not claimed me a real primesearcher, but thank you for the title.
I'm collecting data in prime numbers for k*2^n-1 (mostly and others, too) for 14 years now (my first page for RPS was in 2007), because there was no data collection in an oversesable form: many small personal projects, some others only testing some ranges, and all data spread around the net. You even don't know how much work I've done over the years and how disappointing it is to see only a prime and no further information like tested ranges. So even if somebody is logged in here, why no further information should be given? In the primesearch community nothing is more annoying to test open ranges to fill some missing data. That's my real concern: to document the whole data to avoid duplicate and disappointing work for others. |
![]() |
![]() |
![]() |
#252 |
Feb 2019
5F16 Posts |
![]()
Just wanted to let you know that your efforts are greatly appreciated, kar_bon!
|
![]() |
![]() |
![]() |
#253 |
Sep 2002
Database er0rr
22·1,063 Posts |
![]() Last fiddled with by paulunderwood on 2021-08-08 at 00:37 |
![]() |
![]() |
![]() |
Thread Tools | |
![]() |
||||
Thread | Thread Starter | Forum | Replies | Last Post |
Mersenne Primes p which are in a set of twin primes is finite? | carpetpool | Miscellaneous Math | 4 | 2022-07-14 02:29 |
Patterns in primes that are primitive roots / Gaps in full-reptend primes | mart_r | Prime Gap Searches | 14 | 2020-06-30 12:42 |
Distribution of Mersenne primes before and after couples of primes found | emily | Math | 34 | 2017-07-16 18:44 |
Conjecture about Mersenne primes and non-primes v2 | Mickey1 | Miscellaneous Math | 1 | 2013-05-30 12:32 |
possible primes (real primes & poss.prime products) | troels munkner | Miscellaneous Math | 4 | 2006-06-02 08:35 |