Found the solution to the second one. Just using -f <factor> arguments in the command line works.

[QUOTE=bsquared;267117]yafu will now do multi-threaded ecm as well. See [URL="http://www.mersenneforum.org/showpost.php?p=267073&postcount=768"]here[/URL].[/QUOTE]

[strike]Unfortunately, yafu does multi-threaded ecm only in a linux environment.[/strike]

edit: forget about this - I just see that the link points to the new yafu 1.28. :tu:

if yafu/msieve merge, aliqueit will need some rewritting, i suppose, with aliwin/factMsieve.py/pl

Dumb newbie question.

Is there a way to calculate the composite co-factor (the C #)
by just looking at the .elf file? I'm assuming I could calculate it from the last or next to last lines.

[QUOTE=MyDogBuster;270792]Dumb newbie question.[/QUOTE]
Not at all. :smile:
[QUOTE=MyDogBuster;270792]Is there a way to calculate the composite co-factor (the C #)
by just looking at the .elf file? I'm assuming I could calculate it from the last or next to last lines.[/QUOTE]

It depends on whether the .elf file includes the known factors of the final line. .elf files from the FactorDB include this, but .elf files from aliqueit do not. Aliqueit files will still have the last full line, from which you could [URL="http://www.mersennewiki.org/index.php/Aliquot_Sequences"]calculate the sigma[/URL] to find the next line's value, but then you need to find small factors, and that's not so trivial once you get out of the range of trial division. If you're dealing with .elf files from aliqueit, and the aliqueit.log file is still available and has known factors in it, it's possible to parse that just like aliqueit does to find known factors when you resume a sequence.
This is an example line of an .elf file from the FactorDB. It includes the known factors, 2^2, and 563.
[CODE]2714 . 375247612737359925682540703568022294850588605664588516879742440679927639647073049190474908810231710611741449819031639283569939111029903821482111398004455816096353316 = 2^2 * 563[/CODE]
Of course, to find the composite cofactor and its size, you take the number on the left and divide it by the known factors on the right. Obviously, an arbitrary precision integer implementation (e.g. GMP, PARI/GP, or python) is necessary for such large numbers.

Thanks Tim. I didn't think it was easy.

[QUOTE=bsquared;264876]Super. It also looks like you fixed things so that yafu honors the -e switch.

[URL="http://www.sendspace.com/file/2xsay0"]Here [/URL]are some new windows binaries and a linux makefile.[/QUOTE]

Unfortunately the binaries are no longer available on sendspace. Can you please re-upload them?

[QUOTE=Andi47;272615]Unfortunately the binaries are no longer available on sendspace. Can you please re-upload them?[/QUOTE]

I can do better :smile:
They're now on my [URL="https://sites.google.com/site/bbuhrow/home/aliquot-sequences"]webpage[/URL].

[QUOTE=bsquared;272775]I can do better :smile:
They're now on my [URL="https://sites.google.com/site/bbuhrow/home/aliquot-sequences"]webpage[/URL].[/QUOTE]

Haha, figures :) I just finished merging v1.10a and v1.11, producing v1.12 with no other differences and put it up at my usual old place: [url]http://mklasson.com/aliquot.php[/url]

[QUOTE=mklasson;272778]Haha, figures :) I just finished merging v1.10a and v1.11, producing v1.12 with no other differences and put it up at my usual old place: [URL]http://mklasson.com/aliquot.php[/URL][/QUOTE]

Yep, nice timing :)

I put v1.12 up as well to act as a mirror, if that's ok.

[QUOTE=bsquared;272783]Yep, nice timing :)

I put v1.12 up as well to act as a mirror, if that's ok.[/QUOTE]

For sure :tu: