[QUOTE=Dubslow;395409]That is almost certainly not true of the current batch of numbers.[/QUOTE]

You are right. I am trying to interpret the meaning of that post. It didn’t say the numbers were ECMed to t40, just start ECM at t40. That’s why I didn’t bother with numbers until C180 to perform ECM.

Good catch. :smile:

[QUOTE=RichD;395440]You are right. I am trying to interpret the meaning of that post. It didn’t say the numbers were ECMed to t40, just start ECM at t40. That’s why I didn’t bother with numbers until C180 to perform ECM.

Good catch. :smile:[/QUOTE]

I happened to be reading some older posts, and stumbled upon that post from its context -- it was in response to a question about a specific file at a specific time.

By the way, some older posts mentioned various scripts to both parse the relatively dense roadblock files and to check numbers in the FDB before starting work on them. Would people be willing to post theirs?

Finally, more ECM factors:

[code](149107399621^17-1)/149107399620
P41 = 26710960487576079949768373669299633202857
C139 = 2235103488910109947661939213028171125127174997680723090661545701323123822284100156768223195027518635207949822771348015899080261736880797641

(3760067^29-1)/3760066
P37 = 3045509509684144725987510473093336041
P148 = 4186166489605713146158036096510657474413401024347780953303356993463996600310528649365804130589988363389904036136549653876302508962191122828096998241[/code]

That makes 3 of the first 4 on my list of "more ECM" jobs (that I mentioned yesterday) have been at least partially factored by ECM. I also learned from the reading I did that full factorizations are practically useless for OPN, so I won't be NFSing any of the CFs that have been reduced (unless upon request).

Edit: 4 of 5... This is starting to seem incredibly lucky...
[code](28409^43-1)/28408
P39 = 296978085957996408983189599712074177313
P149 = 37362906083966005082435969235437499569403166878650719584880472832288976928794846351610597540137369882527491701462711437445983919474239386830031121107
[/code]

I received a note from Pascal when the MWRB file was re-instated along with updates to the Txxxx files. He also mentioned a new direction for most wanted and that a post will be forth-coming.

Hopefully, he will stick his head in here soon to make some clarifications.

Thank you all for the factors.

We write N = p^e*m^2 for an OPN.
The latest run took about 12 days to obtain N > 10^2000.
The next goal is m > 10^1000.
This will imply the current bound N > 10^2000 and improve
the bound m > 10^75 used in Pomerance's heuristic argument
[url]http://oddperfect.org/pomerance.html[/url]

We will modify the program to obtain lower bounds on m instead of N.
In the mean time, we already know that the composites from the special prime
(of the form sigma(p^1)) in the txxxx files will be wanted. So we can focus on them.

[QUOTE=Dubslow;395452]
This is starting to seem incredibly lucky...
[/QUOTE]
Great ! I hope your luck will continue.

I'll take the first 6 from the t1600 file -- of the form sigma(p^1).

These are small enough that GNFS will be quicker than looking for a special form as described in Batalov's earlier post.

Results so far:
22469^47-1 [code]
r1=477543350616705955411438859692611074706486967 (pp45)
r2=311787544632673452514777995938121107370237503335522083125207819545482666084210356615806161047300643981386730564835049227273889590611835652072394331842305173 (pp156)
[/code] I didn't run ECM against this, I had to start one while my GPU ECMed the rest.

22063^47-1
[code]
Found probable prime factor of 42 digits: 224172527254460923097320700373859558360073
Composite cofactor 287082874607048462762709389763338908094261110505314485350456691813225285074870918722983977765387376614106543543221872724766738313640617335066829783399274580841 has 159 digits
[/code] I assume this doesn't need fully factoring.

22679^47-1
[code]
Found probable prime factor of 47 digits: 12422229658754380220560064955215468939831619943
Probable prime cofactor 18387345750741793931996136644297287902304883406907078934763668163525617698634139636567280746621461990390018506570754589945592757980387843588948764777494527 has 155 digits
[/code]
And 29437^43-1 is in LA, ETA about 3 hours.

@Pascal, does your job automatically pick up results from factordb? If so is it worth posting theme here as well?

Chris

[QUOTE=RichD;395527]I'll take the first 6 from the t1600 file -- of the form sigma(p^1).[/QUOTE]

Done.

Looks like the *2* (C182) has not been claimed. I'll do it next.

Two more results:
29437^43-1 [code]
r1=17407255346082472871143292808345386547997 (pp41)
r2=102961390170911484966305733206846911347633070237205016755503471 (pp63)
r3=27551107793048782479899925721297437513448329366926505446629869370575326960725924864261 (pp86)
[/code] (I should have ECMed it).

23159^47-1 [code]
Found probable prime factor of 44 digits: 12806833559364579769534231363027419918448429
Probable prime cofactor 46739914470997616369452358953972821837916891376917679255479618616521851605018179606094591889214020805633058501450445298862097285377012995349763176580689220349 has 158 digits
[/code]
And reserving:
13513^53-1
I'll run ECM to T50 since it's about SNFS 231. So may need to do soemthing else while the ECM completes.

Chris

Guys, I can host an ecmserver. Got the files here but I don't have a clue on how to set up, how to feed with candidates, etc.

[QUOTE]4) Create an ecmserver.ini file. The minimal format is:
number1
number2
...
In this case names will be assigned to each entry.

A better format (and the save format of ecmserver.ini) is:
name1 N number1
name2 N number2
...

The only limit on the number of entries is memory.
[/QUOTE]So I am trying to create the ecmserver.ini. What should be my entries for OPN? I need a list of
name1 N number1

[QUOTE=pinhodecarlos;395610]So I am trying to create the ecmserver.ini. What should be my entries for OPN? I need a list of
name1 N number1[/QUOTE]

There is a wide range of numbers of interest. Do you want to limit the quantity and sizes to things that could be used by NFS@Home in the upcoming Need for Speed? If yes, what SNFS and GNFS sizes? I think we should select from Pascal's "Most Wanted" list, then from his "First Composites" lists. Other sources are possible, too.