20090303, 20:17  #1 
Nov 2008
2×3^{3}×43 Posts 
10000 posts!
The factoring forum has just passed a new milestone!
I think this was the 10000th post: http://www.mersenneforum.org/showpos...1&postcount=24 Last fiddled with by 10metreh on 20090303 at 20:21 
20090303, 20:27  #2 
A Sunny Moo
Aug 2007
USA (GMT5)
3·2,083 Posts 
Wow! I'd never noticed this before, but indeed it seems that only the Lounge beats the Factoring forum for total # of posts, at 17896 as of this writing.

20090317, 17:59  #3 
Nov 2008
2×3^{3}×43 Posts 
due to aliquot sequences

20090319, 00:28  #4  
Nov 2003
2^{2}×5×373 Posts 
Quote:
Mersenne hunters and the 100M crowd. Those are not factoring efforts. 

20090319, 04:02  #5 
"Phil"
Sep 2002
Tracktown, U.S.A.
3×373 Posts 
Except that their principal activity is factoring. In support of a prime searching project, of course, but they do this by factoring.

20090319, 11:59  #6  
Nov 2003
7460_{10} Posts 
Quote:
They are simply attempting to find composites by finding a single very tiny prime factor. They are entirely different concepts. 

20090319, 20:07  #7 
"Phil"
Sep 2002
Tracktown, U.S.A.
45F_{16} Posts 
I would not say that they are "entirely different" concepts. Granted, to someone like yourself who has worked extensively on quadratic sieves and NFS, the goal of completely factoring a number into its prime factors on the one hand, and looking for one or a few small factors with a very small hope of a complete factorization on the other, look like extremely different undertakings in the methods used and the kinds of results attained, but both are still variations on the general theme of factoring. Here in the factoring subforum, we have had a number of individuals using P1 or ECM looking for factors of large numbers that are unlikely to yield complete factorizations. How is this different from looking for factors of large Mersenne numbers by trial factoring?

20090319, 21:37  #8  
Nov 2003
2^{2}·5·373 Posts 
Quote:
to efforts to factoring numbers. There is a separate subforum for those looking for primes. Finding a small factor is not a factoring effort. It is simply a quick method for finding composites. 

20090320, 12:32  #9  
Jun 2003
7×167 Posts 
Quote:


20090320, 13:02  #10  
Nov 2003
1110100100100_{2} Posts 
Quote:
I am simply suggesting that the 'Marin Mersenaries', 'Lone Mersenne Hunters', and 'Billion Digit' subforums be MOVED from the 'Factoring Projects' parent forum to the 'GIMPS' parent forum. These three subforums are aimed at finding Mersenne primes, and not aimed at factoring numbers. They simply use the finding of small factors as a means of eliminating Mersenne prime candidates. 

20090320, 16:03  #11 
"Phil"
Sep 2002
Tracktown, U.S.A.
3×373 Posts 

Thread Tools  
Similar Threads  
Thread  Thread Starter  Forum  Replies  Last Post 
3^10000+2 is composite  davar55  Lounge  19  20150531 16:02 
GPU sieving drive part III: k<10000 n=3M6M  mdettweiler  No Prime Left Behind  19  20110217 21:13 
GPU sieving drive part II: k<10000 n=2M3M  mdettweiler  No Prime Left Behind  44  20101128 10:59 
Bigger and better GPU sieving drive: k<10000 n<2M  mdettweiler  No Prime Left Behind  61  20101029 18:48 
lag in factoring Mersenne numbers (P < 10000)?  ixfd64  Factoring  1  20060102 08:25 