20091025, 08:27  #1 
Nov 2008
2×3^{3}×43 Posts 
Subproject #4: 10k50k sequences to 110 digits
Right then, here we go. Take sequences to 110 digits. The next subproject after this will probably be 50k100k to 110 digits.
Sadly there will be very few driverless sequences in this subproject because Clifford Stern has worked on them, but we are hoping for a couple of terminations anyway. This subproject is complete! Subproject #6 has started. Last fiddled with by 10metreh on 20100728 at 07:21 Reason: updating 
20091025, 09:15  #2 
May 2009
Russia, Moscow
2450_{10} Posts 
Taking 11040, it's now size 109 with chance to escape from 2^4*31 driver.
Last fiddled with by 10metreh on 20100509 at 17:03 
20091025, 09:19  #3 
Nov 2008
2·3^{3}·43 Posts 

20091025, 13:45  #4 
May 2009
Dedham Massachusetts USA
3×281 Posts 
Reserving 12048, 12960

20091025, 16:29  #5 
May 2009
Russia, Moscow
2·5^{2}·7^{2} Posts 
Ok. 2^4*31 was gone on next iteration after I taking it, now 2^2 guide. And another interesting thing  c40 on P1 with B1=11e4, it's quite rarely.
Code:
[Oct 25 2009, 19:21:42] Cofactor 35438288778883741901846977908834654106992920711709820109695229406373740167644758563654018774008812277932269 (107 digits) [Oct 25 2009, 19:21:42] c107: running rho... [Oct 25 2009, 19:21:42] c107: running P1 at B1=11e4... Using B1=110000, B2=39772318, polynomial x^1, x0=1361616734 Step 1 took 172ms Step 2 took 93ms ********** Factor found in step 2: 4481460980912912496950001524923679495513 [Oct 25 2009, 19:21:42] *** c40 = 4481460980912912496950001524923679495513 Last fiddled with by unconnected on 20091025 at 16:31 
20091029, 10:09  #6 
Just call me Henry
"David"
Sep 2007
Cambridge (GMT)
2×5×569 Posts 
Reserving 11352, 11496, 11820, 11826

20091029, 14:27  #7 
May 2009
Dedham Massachusetts USA
1513_{8} Posts 
Done with 12048, 111 digits, 2^2*7

20091029, 20:53  #8 
Feb 2005
The Netherlands
218_{10} Posts 
Reserving 13056

20091029, 21:19  #9 
May 2009
Russia, Moscow
2·5^{2}·7^{2} Posts 
Reserving 13800.

20091030, 02:43  #10 
May 2009
Dedham Massachusetts USA
843_{10} Posts 
Done with 12960, 116 digits, 2^3*3*5
Reserving: 14676, 14706, 14922, 14970, 14994 
20091030, 09:31  #11  
Nov 2008
4422_{8} Posts 
Quote:
Code:
[Sep 26 2009, 17:56:38] c73: running P1 at B1=22e4... Using B1=220000, B2=658485462, polynomial x^1, x0=2824457235 Step 1 took 359ms Step 2 took 656ms ********** Factor found in step 2: 88002712661582093913481380044293027119959 [Sep 26 2009, 17:56:39] *** c41 = 88002712661582093913481380044293027119959 Also, a c40 in step 1, that would have been found in step 1 as low as B1 = 25033: Code:
[Aug 21 2009, 11:43:26] c74: running P1 at B1=22e4... Using B1=220000, B2=658485462, polynomial x^1, x0=2143853441 Step 1 took 359ms ********** Factor found in step 1: 9100785968019815128384673673530868078937 [Aug 21 2009, 11:43:26] *** c40 = 9100785968019815128384673673530868078937 And yes, if you ask, I have kept my logfiles as far back as 27 July. I like keeping them because they contain unusual factors like these. Last fiddled with by 10metreh on 20091030 at 09:35 

Thread Tools  
Similar Threads  
Thread  Thread Starter  Forum  Replies  Last Post 
Subproject #9: 150k200k sequences to 110 digits  MiniGeek  Aliquot Sequences  151  20110514 09:01 
Subproject #6: 50k100k sequences to 110 digits  10metreh  Aliquot Sequences  203  20101114 15:00 
Subproject #5: 800k900k sequences to 100 digits  10metreh  Aliquot Sequences  431  20100518 02:21 
Subproject #2: 500k600k sequences to 100 digits  10metreh  Aliquot Sequences  690  20091014 09:02 
Subproject #1: 210k250k sequences to 100 digits  henryzz  Aliquot Sequences  204  20090730 12:06 