20121023, 01:49  #23 
"Serge"
Mar 2008
Phi(4,2^7658614+1)/2
2^{3}·11·107 Posts 
It is basically log_{2}(k)+n rounded up.

20121023, 01:56  #24 
Apr 2010
Over the rainbow
3·853 Posts 
so thats around 1.02 % for n=25, and between 2.85% & 2.66% for 2631?
gaaa... thats not large 
20121023, 02:03  #25 
"Serge"
Mar 2008
Phi(4,2^7658614+1)/2
2^{3}×11×107 Posts 
Not quite 100%, agreed. But they (sort of) sum up, and with patience...
... ... PROFIT! ________ *They don't really sum up; if you had two runs with p_{1} and p_{2}, then p = 1  (1p_{1})(1p_{2}) = p_{1}+p_{2}  p_{1}p_{2} (but the last part is tiny) if you had five runs with p_{1}...p_{5}, then p = 1  (1p_{1})(1p_{2})(1p_{3})(1p_{4})(1p_{5}) and after many, many runs you will level at 100% ;) 
20121105, 13:07  #26 
Romulan Interpreter
Jun 2011
Thailand
24E0_{16} Posts 
Ok. Got the v26, tested, pass all (5) tests, now what?
It is a bit difficult to follow with reservations, the fronts seems to move very fast, I have no idea what work should I do. Where should I go to see what is wanted, what is available? @SB: can you assign me ("the most wanted" hehe) 12 (onetwo) weeks worth of work on one GTX580? (about, more or less) or, is any page so clear as doublemersenne page, where I can go and try one assignment? It is quite difficult for me to follow with all the reservations in this thread, especially because I am involved in other things, and I am not so well educted in gfn's and there are 5 different tails/bases to follow.... edit: ok, i hope i got it right: reserving gfn3: N=2531  k from 500e12 I see this is not so much claimed. I have no idea "how high" I can go, because I have no idea how fast it is. I will just fill my worktodo with lines and let it crawl. Last fiddled with by LaurV on 20121105 at 13:22 
20121105, 13:34  #27 
Apr 2010
Over the rainbow
3×853 Posts 
for this range, on a 560 it goes around one hour for 20e12so assuming double the speed of that 40e12 for one hour, (40*24*7)/7 you should be able to get them by 1500e12
Last fiddled with by firejuggler on 20121105 at 13:53 
20121105, 18:07  #28  
"Serge"
Mar 2008
Phi(4,2^7658614+1)/2
10010011001000_{2} Posts 
Quote:
I remind that the probability of success per unit of time is ~ O(1/kN^{2}). 

20150118, 09:45  #29 
"Tapio Rajala"
Feb 2010
Finland
473_{8} Posts 
I just remembered that I am still missing that gfn6factor. Thus, before devoting the GPU to finding Fermat factors, I'll continue a bit the search for gfn6. To start, I reserve
gfn6: N=5069, k=260e12300e12 
20150118, 19:40  #30 
"Serge"
Mar 2008
Phi(4,2^7658614+1)/2
2^{3}×11×107 Posts 
Eggcellent! But wait  you may have it at higher n's (as a byproduct of Fermat Factor / GFN searches), no? It still counts! ;)

20150119, 07:49  #31 
"Tapio Rajala"
Feb 2010
Finland
315_{10} Posts 

20151231, 11:18  #32 
"Matthew Anderson"
Dec 2010
Oregon, USA
2×359 Posts 
Hi All
I just so happen to be a hungry for factors I have three computers in my living place. One of the is the upstairs computer, okay there is a second upstairs computer because I have a tenant. .... And for the last few weeks he owes me money. My wife's computer, which I am right now typing on has a black and white cover. I use this computer for the "folding at home" BONIC run by Stanford University. because Parkinson's disease is a bad thing. I don't really use her computer for Prime95 anymore. My Black computer is cusum ordered from Blue Dragon Computer here in Salem Oregon USA. It required a second trip to the computer store, but I like that place. It is better than the Geek Squad Guys who work for Best Buy here in ... USA. I prefer to avoid chains whenever possible. Having typed all of that. Go Team Go Last fiddled with by MattcAnderson on 20151231 at 11:18 Reason: should add quotes . .. 
20161103, 17:00  #33 
"Serge"
Mar 2008
Phi(4,2^7658614+1)/2
2^{3}·11·107 Posts 
Awww... We can now find so many previously unknown GFN_{7} and GFN_{11}'s!
I wasn't coding mmffgfn for them because of lack of the public interest, but now... just wait and see... I'll post the code, and perhaps the binaries can be built by the usual suspects and I will create new reservation pages for GFN_{7} and GFN_{11}'s! 
Thread Tools  
Similar Threads  
Thread  Thread Starter  Forum  Replies  Last Post 
GFN factoring with mmffgfn  Results  Batalov  Operazione Doppi Mersennes  126  20161112 12:22 
mmff checkpoints  houding  Factoring  1  20150902 19:32 
mmff parameters  MattcAnderson  Operazione Doppi Mersennes  2  20150708 15:28 
Output bug in mmff  ATH  Operazione Doppi Mersennes  8  20120918 15:57 
P minus 1 factoring  information and reservations  philmoore  Five or Bust  The Dual Sierpinski Problem  1  20100407 22:25 