![]() |
![]() |
#1 |
"Jason Goatcher"
Mar 2005
3×7×167 Posts |
![]()
I apologize for this easy question, but when I tried to search for the obvious 'ecm=' as a search term, both Mersenne Forum and Google choked on the '=' even though it was typed as
Code:
"ecm=" Edit: For version 24.14 Edit 2: It has to do with numbers b^n-1, with b an odd prime and n a prime. The Odd Perfect Number search is what I'm crunching for. If it helps you help me, than the specific numbers at the moment are 2801^79-1 and 2801^83-1. Last fiddled with by jasong on 2007-11-16 at 01:08 |
![]() |
![]() |
![]() |
#2 | |
"Jason Goatcher"
Mar 2005
3·7·167 Posts |
![]()
I found the following in the mprime readme.txt file. What are the 'not used anymore' options?
Quote:
|
|
![]() |
![]() |
![]() |
#3 |
"Jason Goatcher"
Mar 2005
3×7×167 Posts |
![]()
Found the answer:
ECM2=k,b,n,c,B1,B2,curves_to_do[,specific_sigma,B2_start] |
![]() |
![]() |
![]() |
#4 |
P90 years forever!
Aug 2002
Yeehaw, FL
1FD616 Posts |
![]()
For b != 2, GMP-ECM may be faster.
|
![]() |
![]() |
![]() |
Thread Tools | |
![]() |
||||
Thread | Thread Starter | Forum | Replies | Last Post |
decoding results lines | dbaugh | PrimeNet | 3 | 2015-12-17 07:22 |
Multiply By Drawing Lines | petrw1 | Math | 2 | 2014-05-20 06:13 |
Put-down lines | davieddy | Soap Box | 3 | 2011-12-14 20:53 |
Lines in a Square | Kees | Puzzles | 16 | 2009-05-07 15:24 |
Duplicate lines in HRF3.TXT | GP2 | Data | 2 | 2003-10-04 01:27 |