20191220, 06:38  #749 
Oct 2007
London, UK
2^{2}×5^{2}×13 Posts 
A rather surprising result for this number in the t800 file:
(11678983384265232966613390730340859^71) / (p1) = 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^71 in the t800 file where p has <=35 digits. Last fiddled with by lavalamp on 20191220 at 06:42 
20200109, 12:12  #750 
Sep 2008
Kansas
5711_{8} Posts 
t2100.txt
All the C140s are factored. I am starting with the C141s.

20200124, 01:31  #751  
Sep 2008
Kansas
101111001001_{2} Posts 
Quote:


20200124, 01:35  #752 
Sep 2008
Kansas
7×431 Posts 
A few smallish numbers have appeared in the t2100 file in the midC110 range. I have been working the C141 range so no conflict by me.

20200616, 00:15  #754 
Sep 2008
Kansas
7·431 Posts 
732541^471

20200616, 01:59  #755 
"Curtis"
Feb 2005
Riverside, CA
1000010010011_{2} Posts 
I'm game to do another hybrid CADO/15equeue job with SNFS; we've done GNFS197 and GNFS198 somewhat profitably, and trying an iffy SNFS job seems fine.
I won't have humantime 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 Qmax 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 "10150 on CADO A=30, 150800 on 15e" or "20100 on I=16, 100700 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. 
20200616, 08:16  #756 
Just call me Henry
"David"
Sep 2007
Cambridge (GMT)
2^{6}×89 Posts 
ryanp gave in trying to factor 732541^471 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.

20200616, 13:23  #757  
Sep 2008
Kansas
7·431 Posts 
At one point in time ryanp had an interest in working a few OPN. I suppose Real Life^{TM} issues came up. This was my last correspondence to him and possibly a starting point for moving forward.
Quote:


20200616, 16:08  #758  
Sep 2008
Kansas
7·431 Posts 
Quote:
Edit: BTW, 6115909044841454629^171, SNFS301 (octic). Last fiddled with by RichD on 20200616 at 16:38 

20200617, 16:05  #759  
Sep 2009
3507_{8} Posts 
Quote:
Chris 

Thread Tools  
Similar Threads  
Thread  Thread Starter  Forum  Replies  Last Post 
Passive Pascal  Xyzzy  GPU Computing  1  20170517 20:22 
Tesla P100 — 5.4 DP TeraFLOPS — Pascal  Mark Rose  GPU Computing  52  20160702 12:11 
Nvidia Pascal, a third of DP  firejuggler  GPU Computing  12  20160223 06:55 
Calculating perfect numbers in Pascal  Elhueno  Homework Help  5  20080612 16:37 
Factorization attempt to a c163  a new Odd Perfect Number roadblock  jchein1  Factoring  30  20050530 14:43 