![]() |
|
|
#12 | |
|
Sep 2002
2×3×7×19 Posts |
Quote:
|
|
|
|
|
|
|
#13 | |
|
Nov 2003
22·5·373 Posts |
Quote:
Read xyzzy's quote of Thomas Paine. |
|
|
|
|
|
|
#14 | |
|
Sep 2002
2×3×7×19 Posts |
Quote:
|
|
|
|
|
|
|
#15 | |||||
|
"Richard B. Woods"
Aug 2002
Wisconsin USA
22×3×641 Posts |
Quote:
I'm not an ECM expert, but even I could, within a few seconds of reading jasong's questions, (1) realize what he was asking about, (2) recognize a common erroneous ECM-novice assumption underlying his questions, and (3) outline how I could have answered. Then I saw that others had already answered adequately. Quote:
Quote:
Quote:
Quote:
(Take a look at the recent commemorative US quarter honoring Wisconsin. Around here, one smiles when one says "cheese".) Last fiddled with by cheesehead on 2006-03-09 at 05:54 |
|||||
|
|
|
|
|
#16 |
|
Dec 2004
13·23 Posts |
Well I currently have some of my CPU's dedicated to OPN the ones with large amounts of memory anyways. But most of my computer power is on SoB.
You realise that those projects also look for factors? SoB has a P-1 section which uses Prime95, we also use proth sieve. Granted SOB is not using ECM which is I think the factoring method you'd like to use to find a factor, correct? My effort in OPN is directed towards understand ECM and SNFS and yes it's fun to find factors. (Useful or interesting factors) vs (easily found) are on two different sides of the fence with ECM you have to understand this. I havn't used the server, but I'd imagine that your trying to test the 40+ digit level on composites (non-prime numbers) with 250 or greater digits. Chances are not great and individual curves take some time. However if you do find one using the server it's certainly something. Also the chances of finding a factor with OPN are significantly greater than finding a prime with SoB or mersenne. If you simply want to find a factor I'm sure someone could post a smaller composite here for you to test. But regardless it will still take time. Try something smaller off the small composites page... http://oddperfect.org/composites.html I'd suggest C154 196 B1=11e6 2127 (P337-1)* 2676698084506621516487420852300164410053248582152174619643569800986881// 174236072670890529076055343512294222991036475553140273343474604222274169771155990537 Use b1=44M (45-digit factor) you might get lucky, chances there look pretty good. Last fiddled with by smh on 2006-03-10 at 12:59 |
|
|
|
|
|
#17 |
|
"Jason Goatcher"
Mar 2005
DB316 Posts |
Honestly, I didn't know I'd cause such an uproar.
If Mr. Silverman still looks at this thread, I'd like to point out that saving up the money to buy a computer can be an accomplishment itself, and if one wants to amuse themselves by maxing out their cpu with something, more power to them. I remember once stating the opinion that I'd be happy if a friend ran the "Monkey Shakespeare Project" since that would mean he had the same hobby as me, DC. Everyone is little in some way, but no one wants to feel little. Sometimes humility is the road to bigger things. Oh, and if anybody thinks what I said is really wise, I give the credit to a certain Jew that was crucified at age 33. I'll get my props someday, even if that day isn't today. |
|
|
|
![]() |
Similar Threads
|
||||
| Thread | Thread Starter | Forum | Replies | Last Post |
| Finding prime factors for 133bit number | noodles | YAFU | 2 | 2017-05-12 14:00 |
| Client can't connect to server | Cow_tipping | Prime Sierpinski Project | 1 | 2011-10-11 19:06 |
| Finding Wrong Factors | lindee | Information & Answers | 31 | 2010-12-03 12:50 |
| Finding factors of cunningham-like numbers | Zeta-Flux | Factoring | 187 | 2008-05-20 14:38 |
| can't connect to server | daWabbit | Software | 7 | 2002-08-31 23:10 |