mersenneforum.org OddPerfect enthusiasts & others: ECM help needed!
 User Name Remember Me? Password
 Register FAQ Search Today's Posts Mark Forums Read

 2010-08-18, 21:08 #45 bsquared     "Ben" Feb 2007 2×17×97 Posts Intel X5570 @2.93 GHz Code: GMP-ECM 6.3 [configured with GMP 5.0.1 and --enable-asm-redc] [ECM] Input number is (3^607-1)/2 (290 digits) Using B1=260000000, B2=3178559884516, polynomial Dickson(30), sigma=4175656254 Step 1 took 2577000ms Step 2 took 497196ms There are many such cores available... but they are highly utilized. I'll try to put away a few curves in off hours.
 2010-08-19, 11:41 #46 bsquared     "Ben" Feb 2007 2·17·97 Posts 224 curves done.
2010-08-19, 12:29   #47
Raman
Noodles

"Mr. Tuch"
Dec 2007
Chennai, India

3·419 Posts

Quote:
 Originally Posted by R.D.Silverman I disagree that it helps the tail-chasing for OddPerfect since I think that project is pointless. Raising the bound on the minimal size for an odd perfect number does nothing toward proving that none exist. All the wasted CPU time for this project would be much better spent on (say) Seventeen or Bust which has a definitive END. BTW: Didn't your mother ever tell you "finish what you start before doing something new"?
I approve with 3,607- rather. My perspective is not from odd perfect numbers increasing lower bound. But it is a number with no known non-primitive factors (similar to that of M1061), and that it is only a bit beyond the official table limits for base 3. Anyway, it is after all going to be added up to that official base 3 tables someday. In my opinion, base 3 table limits of 600 are much lesser than when compared up with that other base Cunningham tables.
Only the trivial factor of 2 is known, and that it is going to be done by using SNFS only after that it receives up with a sufficient amount of ECM.

By the way, I think of doing some numbers from that base 2 LM tables (quartics) after finishing off with sieving for 5,415+. 2,2226L 2,2238L 2,1870L 2,1870M 2,1910M. Say what you want to do, the rest I will do so with, before 2,2334M, 2,985-.

Last fiddled with by Raman on 2010-08-19 at 12:30

2010-08-19, 12:57   #48
R.D. Silverman

Nov 2003

723210 Posts

Quote:
 Originally Posted by Raman I approve with 3,607- rather. My perspective is not from odd perfect numbers increasing lower bound. But it is a number with no known non-primitive factors (similar to that of M1061), and that it is only a bit beyond the official table limits for base 3. Anyway, it is after all going to be added up to that official base 3 tables someday. In my opinion, base 3 table limits of 600 are much lesser than when compared up with that other base Cunningham tables. Only the trivial factor of 2 is known, and that it is going to be done by using SNFS only after that it receives up with a sufficient amount of ECM. By the way, I think of doing some numbers from that base 2 LM tables (quartics) after finishing off with sieving for 5,415+. 2,2226L 2,2238L 2,1870L 2,1870M 2,1910M. Say what you want to do, the rest I will do so with, before 2,2334M, 2,985-.
I will take 2,1870L,M. Take the rest.

2010-08-19, 13:33   #49
bdodson

Jun 2005
lehigh.edu

210 Posts

Quote:
 Originally Posted by bsquared 224 curves done.
I'm at 3100 curves, but would prefer to keep my count separately
from the OP ecm server count. I'm just finishing sieving 2,1043+
but won't have diskspace for postprocessing or starting sieving on
our next sieving target (that c161 gnfs that was making the rounds,
until Serge steped in). So I may have the quadcore cluster available
for ecm on 3,607- for a few days until 2, 919- finishes (we hope!).

-Bruce

2010-08-19, 13:39   #50
Raman
Noodles

"Mr. Tuch"
Dec 2007
Chennai, India

3×419 Posts

Quote:
 Originally Posted by R.D. Silverman I will take 2,1870L,M. Take the rest.
Ok. It is too early to reserve for now, rather I will reserve that up when time comes...

PS: Other compatible sized numbers are 10,550M 5,815L 10,530M (other than 5,785M of course)

Last fiddled with by Raman on 2010-08-19 at 13:42

 2010-08-19, 17:26 #51 frmky     Jul 2003 So Cal 32×227 Posts I don't have the privileges necessary to keep a count of the curves done in the first post. Batalov or fivemack, would you mind? Thanks!
 2010-08-19, 18:11 #52 Batalov     "Serge" Mar 2008 Phi(4,2^7658614+1)/2 22·2,281 Posts Me neither (I am a local greenfingers). Need Jasonp. Bruce: I will email small details about possible gzipping. -- I do like to stand under built bridges. Anyway, M919 will vacate the premises on Monday (if all goes well), if there's no time for experiments then no need to change your plans. Last fiddled with by jasonp on 2010-08-19 at 19:29 Reason: sorry, too busy right now
2010-08-19, 19:02   #53
em99010pepe

Sep 2004

54168 Posts

~320 curves done.
Attached Files
 320curves.zip (8.7 KB, 61 views)

2010-08-19, 19:11   #54
xilman
Bamboozled!

"𒉺𒌌𒇷𒆷𒀭"
May 2003
Down not across

22×32×281 Posts

Quote:
 Originally Posted by Batalov I do like to stand under built bridges.
You mean you're a troll?

Paul

 2010-08-19, 20:31 #55 Batalov     "Serge" Mar 2008 Phi(4,2^7658614+1)/2 912410 Posts Do trolls build bridges? Yeah. I know that these days engineers don't stand under the bridges they built. That's so old fashioned. But I do. Last fiddled with by Batalov on 2010-08-19 at 20:42 Reason: (our fairy tales are different)

 Thread Tools

 Similar Threads Thread Thread Starter Forum Replies Last Post zeit PrimeNet 3 2008-04-25 08:03 Zeta-Flux Cunningham Tables 69 2008-04-24 11:04 jasong GMP-ECM 11 2007-05-30 03:08 wblipp Factoring 33 2005-10-05 03:19 Prime95 Software 5 2005-06-17 15:54

All times are UTC. The time now is 11:57.

Fri Oct 23 11:57:18 UTC 2020 up 43 days, 9:08, 0 users, load averages: 1.16, 1.46, 1.39

Powered by vBulletin® Version 3.8.11
Copyright ©2000 - 2020, Jelsoft Enterprises Ltd.

This forum has received and complied with 0 (zero) government requests for information.

Permission is granted to copy, distribute and/or modify this document under the terms of the GNU Free Documentation License, Version 1.2 or any later version published by the Free Software Foundation.
A copy of the license is included in the FAQ.