![]() |
![]() |
#749 |
Oct 2007
Manchester, UK
2×3×223 Posts |
![]()
A rather surprising result for this number in the t800 file:
(11678983384265232966613390730340859^7-1) / (p-1) = 4201 * p45 * p50 * p108 Presumably some unlucky ECM that didn't catch the p45 at least? Edit: I believe I have now finished off all numbers of the form p^7-1 in the t800 file where p has <=35 digits. Last fiddled with by lavalamp on 2019-12-20 at 06:42 |
![]() |
![]() |
![]() |
#750 |
Sep 2008
Kansas
7·463 Posts |
![]()
All the C140s are factored. I am starting with the C141s.
|
![]() |
![]() |
![]() |
#751 | |
Sep 2008
Kansas
7×463 Posts |
![]() Quote:
|
|
![]() |
![]() |
![]() |
#752 |
Sep 2008
Kansas
7×463 Posts |
![]()
A few smallish numbers have appeared in the t2100 file in the mid-C110 range. I have been working the C141 range so no conflict by me.
![]() |
![]() |
![]() |
![]() |
#754 |
Sep 2008
Kansas
62518 Posts |
![]() |
![]() |
![]() |
![]() |
#755 |
"Curtis"
Feb 2005
Riverside, CA
7·659 Posts |
![]()
I'm game to do another hybrid CADO/15e-queue job with SNFS; we've done GNFS197 and GNFS198 somewhat profitably, and trying an iffy SNFS job seems fine.
I won't have human-time to test params nor yields with CADO until the end of June; if any of the usual suspects wishes to do some yield calcs, please be my guest. I'd say Q-max of 800M in 15e is a reasonable target. So, what Q should be done in CADO (and should they be done with A=30 or I=16) such that doing the rest of the Q up to 800M yields enough relations? I'm looking for an answer like "10-150 on CADO A=30, 150-800 on 15e" or "20-100 on I=16, 100-700 on ggnfs". Anyone willing to do such test sieving in a way that tries to minimize total sieve time will find a willing CADO host come 1 july. I haven't done an SNFS job above 900 bits yet, so I'd also like the param choices to be spelled out so I set up CADO correctly: sieve which side, 3LP on which side, lims. I assume 33LP since we're stretching 15e. |
![]() |
![]() |
![]() |
#756 |
Just call me Henry
"David"
Sep 2007
Cambridge (GMT/BST)
2·2,897 Posts |
![]()
ryanp gave in trying to factor 732541^47-1 due to it running into weird issues with lasieve(random low yield on some q if I remember right). I would suggest doing this one purely CADO would be the most sensible way. I think this one would have been done ages ago if it wasn't for this issue.
|
![]() |
![]() |
![]() |
#757 | |
Sep 2008
Kansas
CA916 Posts |
![]()
At one point in time ryanp had an interest in working a few OPN. I suppose Real LifeTM issues came up. This was my last correspondence to him and possibly a starting point for moving forward.
Quote:
|
|
![]() |
![]() |
![]() |
#758 | |
Sep 2008
Kansas
62518 Posts |
![]() Quote:
Edit: BTW, 6115909044841454629^17-1, SNFS-301 (octic). Last fiddled with by RichD on 2020-06-16 at 16:38 |
|
![]() |
![]() |
![]() |
#759 | |
Sep 2009
22·32·5·11 Posts |
![]() Quote:
Chris |
|
![]() |
![]() |
![]() |
Thread Tools | |
![]() |
||||
Thread | Thread Starter | Forum | Replies | Last Post |
Passive Pascal | Xyzzy | GPU Computing | 1 | 2017-05-17 20:22 |
Tesla P100 — 5.4 DP TeraFLOPS — Pascal | Mark Rose | GPU Computing | 52 | 2016-07-02 12:11 |
Nvidia Pascal, a third of DP | firejuggler | GPU Computing | 12 | 2016-02-23 06:55 |
Calculating perfect numbers in Pascal | Elhueno | Homework Help | 5 | 2008-06-12 16:37 |
Factorization attempt to a c163 - a new Odd Perfect Number roadblock | jchein1 | Factoring | 30 | 2005-05-30 14:43 |