|
2020-11-21, 17:14
|
#1 |
Sep 2006
The Netherlands
3·269 Posts |
Sieving success as a heuristic for odds of a prime
I'm busy sieving 32767 * 2 ^ n - 1 very deeply now (and busy testing it at the first few millions of bits or so - each time narrowing down the boundaries of the sieve domain).
Well deeply -that's as far as the hardware allows here. Nowhere nearby what PG manages to achieve of course. What i notice is that to my surprise it keeps finding factors and removing exponents also at higher bitlevels. Whereas other riesels with a similar nash weight dry up much sooner. Would the guess be logical to assume then odds for a prime is also much lower than similar nashed k's? |
|
|
 |
| Thread Tools | |
Similar Threads
|
||||
| Thread | Thread Starter | Forum | Replies | Last Post |
| Odds of prime / expected # of primes | gd_barnes | Riesel Prime Search | 16 | 2023-04-25 22:38 |
| Odds of prime discussion | TheCount | Conjectures 'R Us | 30 | 2014-09-08 15:26 |
| Odds that a Random Prime is a Number? | R.D. Silverman | Homework Help | 60 | 2010-10-13 10:31 |
| Odds of a prime number being random | Orgasmic Troll | Lounge | 6 | 2007-08-11 04:09 |
| odds of a random prime being a number | ewmayer | Lounge | 10 | 2007-08-01 20:11 |
