[quote=fivemack;109592]Yes, I've just found in my mailbox a note dated 09:15:03 July 3rd

[code]
A factor was found for 9+2_177 using GMP-ECM using factor method ECM
Candidate number: 9772427779667970572105923716700441661300335714191194679188152573718304961319882235853483233945721929763891
Factor: 4133950704852639743995254229034155182643
Factor Type: probable
Co-Factor: 2363943955160520463564465573348394617953411067782518070887799092737
Co-Factor Type: Probable
[/code]which is I suspect your c106.

This completes the factorisation
[code]
9^354 - 2^354 = 7 * 11 * 67 * 103 * 827 * 2833 * 4603 * 11329 * 12391 * 60889 * 246990049 * 13904870431 * 19305872381432091911171862641472937563203 * 4133950704852639743995254229034155182643 * 2301991204464109524466913171118316852767289469913673 * 2363943955160520463564465573348394617953411067782518070887799092737 * 867308876995997830428936622543114065576392711161602632890678029186916517324393798430730725097
[/code][/quote]

Where can I see the whole table of current done factorization numbers like a^n+-b^n?

[quote=fivemack;109595]I'm not sure how sensible it is to post factors here (I do it from time to time, but generally of numbers that took weeks to compute). Just copy-and-paste the 35-digit prime into the 'Submit' box at [URL="http://www.chiark.greenend.org.uk/ucgi/%7Etwomack/homcun.pl"]http://www.chiark.greenend.org.uk/ucgi/~twomack/homcun.pl[/URL] and send an email to Paul at the address which the factor-submitted form will give you.[/quote]
Ok, I understand you
I have done that for 5 minutes before your post and that didn't work, but nowtime it works!

[QUOTE=VolMike;109597]Where can I see the whole table of current done factorization numbers like a^n+-b^n?[/QUOTE]

At the moment, you go to Paul's Web page [url]http://www.leyland.vispa.com/numth/factorization/anbn/main.htm[/url] but the data is updated only in batches; I get a copy of every email that the ECMNet server sends, which leaves my mailbox very full, but the information isn't automatically made available.

It could be, though I'd have to figure out things I don't presently know about databases, and I'd feel I was stepping vigorously on Paul's toes.

Tom

found per QS / msieve:

Wed Jul 04 11:05:25 2007 prp34 factor: 7390513385464550410373993824644211
Wed Jul 04 11:05:25 2007 prp63 factor: 668132482981060589044136650449474925540132216549598983077934541

Unfortunately, you are not the first:

[code]
2 July 2007 17:23:02 BDT
A factor was found for 8+7_205_1 using GMP-ECM using factor method ECM
Candidate number: 4937842058735194203979723412470325956754576955832780455389764720728883562678173549497894072592151
Factor: 7390513385464550410373993824644211
Factor Type: probable
Co-Factor: 668132482981060589044136650449474925540132216549598983077934541
Co-Factor Type: Probable
B1: 1000000
Sigma: 1932524059
[/code]

I think for the next week or so people should not commit to any calculation which they'd be cross to find was redundant; the load of ECM factors coming in is no longer as crazy as it was, but the path from ECMNet to [url]http://www.chiark.greenend.org.uk/ucgi/~twomack/homcun.pl[/url] is not remotely automated, and something may well stay reservable for a day after ECMnet has found the factor. I think it's best to be greedy and reserve and msieve the smallest number on the table ... at the moment these will usually be the remainder after taking a P35 out of a P125, so you can be reasonably confident that the other factor isn't easily accessible by ecm because otherwise it'd have been found.

Try some small SNFS examples; 123-digit SNFS took 2.25 hours on 9+8_160 on a core2, and figuring out the polynomials is fun for at least the first few.

[QUOTE=fivemack;109613]Unfortunately, you are not the first:
Try some small SNFS examples; 123-digit SNFS took 2.25 hours on 9+8_160 on a core2, and figuring out the polynomials is fun for at least the first few.[/QUOTE]

Unfortunately I did not get any SNFS-program to work under Windows - is there any which runs under XP pro?

[quote=fivemack;109613]Unfortunately, you are not the first:

[code]
2 July 2007 17:23:02 BDT
A factor was found for 8+7_205_1 using GMP-ECM using factor method ECM
Candidate number: 4937842058735194203979723412470325956754576955832780455389764720728883562678173549497894072592151
Factor: 7390513385464550410373993824644211
Factor Type: probable
Co-Factor: 668132482981060589044136650449474925540132216549598983077934541
Co-Factor Type: Probable
B1: 1000000
Sigma: 1932524059
[/code]I think for the next week or so people should not commit to any calculation which they'd be cross to find was redundant; the load of ECM factors coming in is no longer as crazy as it was, but the path from ECMNet to [URL]http://www.chiark.greenend.org.uk/ucgi/~twomack/homcun.pl[/URL] is not remotely automated, and something may well stay reservable for a day after ECMnet has found the factor. I think it's best to be greedy and reserve and msieve the smallest number on the table ... at the moment these will usually be the remainder after taking a P35 out of a P125, so you can be reasonably confident that the other factor isn't easily accessible by ecm because otherwise it'd have been found.

Try some small SNFS examples; 123-digit SNFS took 2.25 hours on 9+8_160 on a core2, and figuring out the polynomials is fun for at least the first few.[/quote]

Sugnifically small value of B1 in ECM for finding factor of 34 digits. Do you use version 6.1 (6.0)? If do, how can I make output file of result's factorization with ECM?

I've just posted another update. This is likely to be the last for a couple of weeks because I'll be away on vacation.


Paul

[QUOTE=VolMike;109632]Sugnifically small value of B1 in ECM for finding factor of 34 digits. Do you use version 6.1 (6.0)? If do, how can I make output file of result's factorization with ECM?[/QUOTE]Not really. Consider this result:
[code]

A factor was found for 9+8_178_1 using GMP-ECM using factor method ECM
Candidate number: 24378661059437515884667577668789715855627240516560797833086878747799247319401997838478474498326476757973070272622944973875154835777
Factor: 1833458752814034489720665284539965888417548073
Factor Type: probable
Co-Factor: 13296541862215655787389860940580737032202722536608159276939900741427568431273295887449
Co-Factor Type: Composite
B1: 3000000
Sigma: 2126166004
Finder: cardinalfan@deleted.
Found on machine: 410
[/code].

That's what I call a significantly large factor for this B1 value.


Paul

[CODE]
7,9,189+.c97=r1*r2

r1=983002703827148535709869877946452353056188129 (pp45)
r2=1607291719275213001968122763352173862476136006438591 (pp52)
[/CODE]

[QUOTE=wpolly;109957][CODE]
7,9,189+.c97=r1*r2

r1=983002703827148535709869877946452353056188129 (pp45)
r2=1607291719275213001968122763352173862476136006438591 (pp52)
[/CODE][/QUOTE]
both factor proven prime with vfypr.