Search:

Type: Posts; User: smh

Page 1 of 12 1 2 3 4

Search: Search took 0.01 seconds.

  1. Replies
    3
    Views
    783

    Louie didn't write the service handler. It's...

    Louie didn't write the service handler. It's Mathguy's

    See Mathguy's post in http://www.free-dc.org/forum/showthread.php?s=&threadid=5155

    It will be fixed in a few days
  2. Replies
    40
    Views
    6,181

    Poll: Citrix, Did you contact Joe McLean about this?

    Citrix,

    Did you contact Joe McLean about this?
  3. Replies
    9
    Views
    1,163

    What Paul meant with: is that sieving at...

    What Paul meant with:



    is that sieving at the current depth is removing candidates at about the same speed as prp testing, so there's no need to continue sieving (if you want to find primes...
  4. Replies
    708
    Views
    161,067

    It's more efficient to sieve all K's at the same...

    It's more efficient to sieve all K's at the same time. Thats why program's were created to do that.

    Sieving only one K will allow sieving much deeper for only that K in the same time, but it will...
  5. Replies
    708
    Views
    161,067

    Just wondering, is this useful for the regular...

    Just wondering, is this useful for the regular NewPgen too?
  6. Thread: p-1 works

    by smh
    Replies
    14
    Views
    4,925

    Yes, sieving is much more cost effective for the...

    Yes, sieving is much more cost effective for the whole project at this moment. But there still needs to be a lot of sieving done on the exponents currentely assigned.

    So to be cost effective, a...
  7. Replies
    31
    Views
    3,422

    I couldn't really remember, but reading the old...

    I couldn't really remember, but reading the old post, it seemed that i didn't submit any of the factors i found, but left it for others (JoeO?) to do so.

    Those factors aren't really worth a lot....
  8. Replies
    31
    Views
    3,422

    Not sure if it's the right topic, but iwas just...

    Not sure if it's the right topic, but iwas just looking at http://www.aooq73.dsl.pipex.com/scores.htm in teh largest factors section.

    I'm missing a few very large factors there. I guess they were...
  9. Thread: chance of a prime?

    by smh
    Replies
    13
    Views
    2,287

    You possibly can't tell which of the numbers will...

    You possibly can't tell which of the numbers will fall next.
  10. Thread: P-1 factorer

    by smh
    Replies
    385
    Views
    110,193

    This could be done the same way as the GIMPS...

    This could be done the same way as the GIMPS client. Let de user specify the ammount of memory stage 2 can use. If there's not enough memory to run stage 2, just skip it and continue testing the...
  11. Thread: P-1 factorer

    by smh
    Replies
    385
    Views
    110,193

    I can't tell anything about the bug, but the...

    I can't tell anything about the bug, but the bonus is probably due to the Brent-Suyama extension, aka Suyama's powers.

    There is a post from Alexander Kruppa about this on the Mersenne mailing...
  12. Replies
    64
    Views
    7,866

    Factors of mersenne numbers are of the form...

    Factors of mersenne numbers are of the form 2*K*P+1

    For a single P, not every K produces a prime, and even if it does, it needs to be 1 or 7 mod 8 (IIRC). So the won't have to test every...
  13. Thread: P-1 factorer

    by smh
    Replies
    385
    Views
    110,193

    Might it be that it also takes a double check and...

    Might it be that it also takes a double check and a small error factor into account?
  14. Replies
    11
    Views
    1,034

    Joe, Which number are you trying to factor?...

    Joe,

    Which number are you trying to factor? 50+ factors are hard to find by ECM, but if the number isn't to large, SNFS (or siqs/mpqs) might be able factor this number faster.

    What bounds are...
  15. Thread: P-1 factorer

    by smh
    Replies
    385
    Views
    110,193

    Louie: the program still doesn't run at idle...

    Louie:

    the program still doesn't run at idle priority by default.
  16. Thread: P-1 factorer

    by smh
    Replies
    385
    Views
    110,193

    Please note that ECM and P-1 are completely...

    Please note that ECM and P-1 are completely different things.

    With ECM you need to run the program several times on the same number to have a reasonable chance to find a factor.

    You'd need to...
  17. Thread: P-1 factorer

    by smh
    Replies
    385
    Views
    110,193

    I don't think you're really unlucky. If you find...

    I don't think you're really unlucky. If you find 2 factors on the 43 tests you're finding factors for about 5% of the numbers.

    It's definately not worth trying P-1 on 500K numbers with these high...
  18. Thread: P-1 factorer

    by smh
    Replies
    385
    Views
    110,193

    To find most 15 digit factors you should run...

    To find most 15 digit factors you should run about 25 curves with B1=2000 (ECM). I haven't tested how long each curve would take though.

    Louie:
    Can you make the next version run at idle priority...
  19. Thread: P-1 factorer

    by smh
    Replies
    385
    Views
    110,193

    Numbers around N=500K already had a lot of...

    Numbers around N=500K already had a lot of sieving done in comparision to the time it takes to prp them. If you spend the optimal time sieving these low numbers you only have the time to sieve with...
  20. Thread: P-1 factorer

    by smh
    Replies
    385
    Views
    110,193

    Of course, 22283121920233 is prime. P-1 = 2 ^...

    Of course, 22283121920233 is prime.

    P-1 = 2 ^ 3 x 3 x 2161 x 3877 x 110819

    Any news on a version that doesn't miss factors on stage two?
  21. Thread: P-1 factorer

    by smh
    Replies
    385
    Views
    110,193

    I tried to factor the number you tried above, but...

    I tried to factor the number you tried above, but it doesn't seem to find a factor.



    D:\factor\p_1\sobp_1>sbfactor 55459 4000006 105 1150
    SBFactor v0.2
    P-1 factoring for number of the form...
  22. Thread: K Completion

    by smh
    Replies
    6
    Views
    821

    You mean you want to test one candidate on...

    You mean you want to test one candidate on multiple computers?

    Thats not possible. The program performs a test that consists of N-1 (or close to that) steps. And the result of each step is the...
  23. Replies
    20
    Views
    1,760

    There is a big difference between blocks. Some...

    There is a big difference between blocks. Some only take 15 minutes, others a couple of hours.

    And at one point the log goes back in time!
  24. Thread: P-1 factorer

    by smh
    Replies
    385
    Views
    110,193

    GIMPS doesn't sieve, they'll trailfactor each...

    GIMPS doesn't sieve, they'll trailfactor each exponent seperately.

    But you are right, their factors have special forms so they won't have to try each prime.
  25. Poll: So this is an easy poll

    So this is an easy poll
Results 1 to 25 of 294
Page 1 of 12 1 2 3 4