![]() |
|
|
#540 |
|
May 2010
Prime hunting commission.
24×3×5×7 Posts |
@Cmd: Please, post something of substance.
Also; Karsten: I managed to do more work in 30 minutes, than I did with the script in 1 hour. Last fiddled with by 3.14159 on 2010-09-19 at 16:49 |
|
|
|
|
|
#541 |
|
May 2010
Prime hunting commission.
24·3·5·7 Posts |
Up to n = 625, which means, I covered every prime under about 1880 digits.
Oops. 1962 digits* Last fiddled with by 3.14159 on 2010-09-19 at 18:54 |
|
|
|
|
|
#542 |
|
May 2010
Prime hunting commission.
24×3×5×7 Posts |
Covered every prime below 2000 digits. Excellent.
Also; in terms of sieving for k * 2594800 + 1; I've sieved to about 23.64 trillion so far. Code:
15:54:47 36131 k's remaining. p=23631242467579 divides k=1138351 Last fiddled with by 3.14159 on 2010-09-19 at 19:57 |
|
|
|
|
|
#543 |
|
Aug 2006
3·1,993 Posts |
|
|
|
|
|
|
#544 | |
|
May 2010
Prime hunting commission.
69016 Posts |
Quote:
2. Each test takes 13.5 to 14 minutes. 3. I'm just a few away from reaching a sieve efficiency of 28. I'm at about 27.5 to 27.7. So far, I have saved 4-6 days of testing over a conventional limit. Last fiddled with by 3.14159 on 2010-09-19 at 21:49 |
|
|
|
|
|
|
#545 |
|
Aug 2006
175B16 Posts |
I would do more sieving, then, until it's 5-7 minutes between eliminations.
Last fiddled with by CRGreathouse on 2010-09-19 at 23:02 |
|
|
|
|
|
#546 |
|
A Sunny Moo
Aug 2007
USA (GMT-5)
3·2,083 Posts |
Where are you getting this "conventional limit"? Usually, the standard procedure for a straight-up prime search (that is, not a conjecture search where a k is no longer searched after a prime is found) is to sieve until the removal rate is equal to the time it takes to do a PRP test about 80% through the range.
|
|
|
|
|
|
#547 | |
|
Aug 2006
3·1,993 Posts |
Quote:
Last fiddled with by CRGreathouse on 2010-09-20 at 03:36 |
|
|
|
|
|
|
#548 | |
|
A Sunny Moo
Aug 2007
USA (GMT-5)
3·2,083 Posts |
Quote:
![]() Last fiddled with by mdettweiler on 2010-09-20 at 03:36 Reason: typo |
|
|
|
|
|
|
#549 |
|
Aug 2006
3×1,993 Posts |
36131 primes remain at sieve efficiency 28 at size 2^594800, so the expected number of primes is 36131 * 28/(594800 * log 2) = 2.45.... Assuming (as mentioned above) that Pi wants to find exactly one prime, one prime should be removed from the first 1/2.45-th of the range in the same amount of time as a PrP test. Assuming (reasonably) that the sieve removes candidates at roughly the same rate throughout the range, that means that the sieving should continue until it takes 1/2.45 times as long as a PrP test. If a PrP test takes 14 minutes, then sieving should take about 14/2.45 = 5.7... minutes.
This procedure should roughly minimize the time needed to find the first prime in the range. To minimize the time needed to test the entire range (if you plan to continue past the first prime), you should sieve until the removal time is equal to the average time for a PrP test, as mdettweiler seems to suggest. Last fiddled with by CRGreathouse on 2010-09-20 at 03:58 |
|
|
|
|
|
#550 | |
|
A Sunny Moo
Aug 2007
USA (GMT-5)
186916 Posts |
Quote:
|
|
|
|
|
![]() |
| Thread Tools | |
Similar Threads
|
||||
| Thread | Thread Starter | Forum | Replies | Last Post |
| Prime posting thread, part 2. (With a catch.) | 3.14159 | Miscellaneous Math | 55 | 2010-11-19 23:55 |
| Tiny range request .... 555.1M | petrw1 | LMH > 100M | 1 | 2010-07-13 15:35 |
| Other primes thread | nuggetprime | No Prime Left Behind | 32 | 2009-10-21 21:48 |
| Error: tiny factoring failed | 10metreh | Msieve | 26 | 2009-03-08 23:28 |
| Tiny error on nfsnet pages. | antiroach | NFSNET Discussion | 1 | 2003-07-08 00:27 |