20110928, 06:12  #562 
Sep 2009
977 Posts 
Thanks to both of you
For now, other persons can still join the fun; in a few days, all tasks are likely to be reserved. In other news, the factorization of 4933^531 is completed by: prp66 factor: 682124495314218121698509554279455063384319487036254811177607644173 prp125 factor: 15087546736509299281340920554482138392768250520514664644614948251205819917930670495559070714562075103199392808634768628382131 (RSALS + Lionel Debroux) Last fiddled with by wblipp on 20111022 at 00:53 Reason: Fix exponent 
20111019, 21:36  #563 
(loop (#_fork))
Feb 2006
Cambridge, England
19·337 Posts 
I have done postprocessing for
173^1091 2467^711 4099^671 571^891 It was a useful opportunity to sort out how to run MPI msieve reasonably efficiently; 571^891 took 234844 seconds (65h14m) on 24 CPUs to solve a 10942652 x 10942830 matrix for an SNFSdifficulty245.3 number. I would be intrigued to know what these factorisations have done for the proof, and where the roadblocks currently lie. Last fiddled with by fivemack on 20111019 at 21:36 
20111022, 11:31  #564 
Apr 2006
101 Posts 
Let be the number of distinct prime factors
and be the total number of prime factors of an odd perfect number N. Your numbers are "Brent composites", of the form p^q1 with p<10000. They appear when we get around roadblocks in the proof of . RSALS is sieving those with SNFS difficulty between 200 and 250 digits. Here are the 100 most difficult composites for the lower bounds on N. http://www.lirmm.fr/~ochem/opn/mostwantedrb.txt It might soon be out of date, check the factordb before starting sieving. The format for p^q1 is "p q1 composite weight", where "weight" is the number of roadblocks involving the composite. The worst is (where ) both for the lower bounds on N and . It is also the only roadblock for the lower bound on , in another paper in preparation. I guess this one won't be done in the near future, but others are interesting and too small for RSALS, for example: 163^891 C195 weight=163041 1021^611 C181 weight=43074 1229^591 C180 weight=34178 2237^531 C175 weight=15846 
20111023, 13:06  #565  
Sep 2004
2×5×283 Posts 
Quote:
Carlos 

20111023, 14:32  #566 
Sep 2009
2,063 Posts 
How much ECM have the C1nn had? I could do a few if you want.
Chris K 
20111023, 19:21  #567  
"William"
May 2003
New Haven
2^{2}×3×197 Posts 
Quote:
The other three are indeed too small for RSALS, but have all had sufficient ECM to begin SNFS. I have others from the most wanted roadblocks that are below RSALS range and ready. I was planning on canvassing for interest in these, but had a shortage of round tuits. Is there interest in these 150200 digit SNFS numbers? Does anyone else have interest in coordinating the work? 

20111023, 21:04  #568 
Sep 2004
B0E_{16} Posts 
I'll do 2237^531.

20111023, 22:32  #569  
"William"
May 2003
New Haven
2^{2}·3·197 Posts 
Quote:


20111024, 16:59  #570 
Sep 2009
2,063 Posts 
I'll do 1229^591.
Chris K 
20111025, 16:57  #571 
Sep 2009
2,063 Posts 

20111026, 14:25  #572  
"William"
May 2003
New Haven
100100111100_{2} Posts 
Quote:
163^891 C195 weight=163041 853^671 C194 weight=38851 1301^591 C181 weight=29908 1381^611 C189 weight=24140 1361^611 C189 weight=24014 1481^611 C191 weight=20179 1487^611 C191 weight=19585 1489^611 C191 weight=19439 2269^531 C175 weight=15620 

Thread Tools  
Similar Threads  
Thread  Thread Starter  Forum  Replies  Last Post 
Odd perfect related road blocks  jchein1  Factoring  31  20090429 15:18 
Odd perfect related number  ZetaFlux  Factoring  46  20090424 22:03 
Question about triming [code] blocks  schickel  Forum Feedback  4  20090401 03:27 
MonoDevelop vs. Code::Blocks  ixfd64  Software  1  20080310 08:30 
Intels Intresting Road  moo  Hardware  7  20051213 02:20 