20140828, 13:12  #166 
Nov 2012
2^{3}×3^{2} Posts 
Code:
17033^531 = 319391252920161429560547697830623021848733 * 33330520337724660774026719117185864816084423298503770977448713371276795862990739368941333958579469564572049892835902778824236910135478940052210949429612763456195776438992014984777 
20140830, 16:02  #167 
Sep 2009
2^{2}·487 Posts 
I won't have finished ECM'ing 7643^591 when 13147^531 starts LA (I'm using a GPU and 1 core for ECM so it takes a while). So I'll reserve some small fry to do while ECM finishes:
21407^471 60259^431 61799548199^171 Chris 
20140907, 15:43  #168 
Sep 2009
2^{2}·487 Posts 
Reserving one more for ECM, to be followed by SNFS if that fails:
3251^611 Chris 
20140908, 05:49  #169 
Nov 2012
110_{8} Posts 
Code:
13331^591 = 80755497159734947485059693840546839 * C205 
20140911, 11:19  #170 
Apr 2006
2^{5}·3 Posts 
http://www.lirmm.fr/~ochem/opn/i_51_2000_101.txt
This file is the intersection of the composites encountered in the proof of the bounds \Omega(N) >= 2\omega(N)+51, N > 10^2000, and \omega(N) >= 101. So if you get a factor, it helps for all 3 proofs. Also, as we branch on the smallest prime for omega(N) >= 101 and on the largest prime for N > 10^2000, a composite in the file is likely to derive from a prime that is the only available prime at some point of the execution of the algorithm. So these composites are bottlenecks. The amount of ECM varies from "maybe not so much" to "a lot, really" for 6115909044841454629^171. Last fiddled with by Pascal Ochem on 20140911 at 11:21 
20140911, 17:19  #171  
Sep 2009
2^{2}·487 Posts 
Quote:
Code:
********** Factor found in step 2: 9937677757664476852904593531609640792365970218237 Found probable prime factor of 49 digits: 9937677757664476852904593531609640792365970218237 Probable prime cofactor 4933435390111026832796658137713158696690314285678621089166487442937825189905611449855687999637684794906443696039349871186136410748647635964240864254651 has 151 digits 

20140914, 15:25  #172 
Sep 2009
1948_{10} Posts 

20140916, 16:02  #173 
Apr 2006
60_{16} Posts 
You can start at T40. And thank you for the factors you already obtained.

20140917, 15:32  #174 
Sep 2009
2^{2}×487 Posts 
I've reached the point in mwrb2000.txt where the next most cost effective number would be 6115909044841454629^171 or 11^3111 (depends how fast 6115909044841454629^171 would be as an octic). They are both out of my range so I'll stop there.
It would still be worth running ECM against the rest of it, there is probably some low hanging fruit waiting to be found. Chris 
20140917, 17:23  #175 
Nov 2012
1001000_{2} Posts 
Code:
6853807^291 = 112590938436045242392801854371922664426393 * C151 
20140924, 05:34  #176 
Nov 2012
2^{3}×3^{2} Posts 
Code:
22787^471 = 4543639013539669426613291598225427127 * 62549558218207738524332749889176473882724629210639329124410765199872180435689083679828086455715730270805552655974310311001299087407579824443318458077069317807742131 
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 