2010-04-15, 22:23 | #1 |
(loop (#_fork))
Feb 2006
Cambridge, England
13×491 Posts |
2801^79-1; thoughts on duplication sampling
I've run a reasonable number of simulations (one more to go), aiming for half a billion raw relations with 32-bit large primes. 16e is a lot slower than 15e; sieving should be on the rational side; the run will probably take 250 million CPU-seconds or so.
I tried doing some experiments to determine duplication rates, on cases where I have the whole sieving run to work on, but I've not been able to get estimates which behave anything like the real answer - I over-estimate the duplication rate enormously, and under-estimate the yield. My estimate for yield was simply to count relations in the first 1% of the range and scale up; this gives the wrong answer (a strong over-estimate for small Q and a strong under-estimate for larger Q) whether I scale up by the ratio of the number of prime ideals or just by the ratio of the width of the Q ranges. My assumption for duplication was that, if sieving a region Q0 < Q < Q1, that I should count with a factor 1/N a relation that has N factors between Q0 and Q1 on the appropriate side; that gave results which are 20% too low. OK, no relation can ever appear more than three times because there are only ever two large primes, but very few relations appear as many as three times so that's not what was causing the discrepancies. |
Thread Tools | |
Similar Threads | ||||
Thread | Thread Starter | Forum | Replies | Last Post |
Duplication of Effort for Smaller Aliquot Sequences | EdH | Aliquot Sequences | 3 | 2018-04-17 13:31 |
Opening thoughts | Batalov | Game 2 - ♔♕♙♘♖♙ - Shaolin Pirates | 5 | 2013-07-26 00:10 |
Duplication of work: local vs. db | EdH | Aliquot Sequences | 2 | 2010-12-31 04:30 |
2801^79-1 reservations (CLOSED 27 AUGUST) | fivemack | Factoring | 76 | 2010-11-06 11:36 |
Client Thoughts | Complex33 | Software | 8 | 2004-02-04 10:46 |