[QUOTE=xilman;99064]So far, eight new factors have arrived at the server in its first 30 hours! That rate will fall off, of course, once the easy ones have been discovered.[/QUOTE]

Paul, that is indeed good news. Although 3+2_458 and 5+3_286 stood no chance ofcourse against the running ECMnet 2.7.3 client loaded with GMP-ECM 6.1.2. I saw that we moved on to the B1=1000000 range which hopefully will find large factors of the remaining composites.

[QUOTE=xilman;99064]
I'd like to request that people connecting to the server try not to connect too often.
[/QUOTE]

Don't worry guys and gals - I'm tail -f'ing the log and it's only a line every few minutes.

Right - get cracking!

5,4,233+
 

[QUOTE=fatphil;99093]Don't worry guys and gals - I'm tail -f'ing the log and it's only a line every few minutes.

Right - get cracking![/QUOTE]

Here is 5,4,233+ C111 = p50.p62

44056865223375581641444494642068764223329664149961
17057488043468155908911647027886752861361432731788610257859303

5,4,232+ is nearly sieved. 5,4,239+ and 5,4,239- will follow.

[QUOTE=fatphil;99093]get cracking![/QUOTE]

Does someone want to get me up to speed. I can't see a simple summary in this thread, and it looks like people are looking outide the range listed in :
[url]http://www.leyland.vispa.com/numth/factorization/anbn/main.htm[/url]

What ranges are of interest in 4^n+3^n?

For example, if you're going beyond 350, then n=351 has this:
(and this was completely trivial, ten minutes work on an old P3)

[code]
? C=subst(polcyclo(702),x,3/4)*4^eulerphi(702)
11918373797533701570043364702426895921596861568814732254151942914041772942209494877872906695265479347288410269727764182956919754721
? C==(314642719 * 3487347163 * 25876141241263871115871 * 6176913048463443825557539 * 496737950461620637069 * 136806203355749662909017142119554851933674613)
1
[/code]

Are these of interest and/or already-known?

I'm interested in the ranges for pretty much all of the tables (it's too hard to describe the ones I'm not interested in).

[QUOTE=fatphil;99103]Does someone want to get me up to speed. I can't see a simple summary in this thread, and it looks like people are looking outide the range listed in :
[url]http://www.leyland.vispa.com/numth/factorization/anbn/main.htm[/url]

What ranges are of interest in 4^n+3^n?

For example, if you're going beyond 350, then n=351 has this:

Are these of interest and/or already-known?

I'm interested in the ranges for pretty much all of the tables (it's too hard to describe the ones I'm not interested in).[/QUOTE]

Interest is in the mind of the beholder.

While others are free to disagree, I like to follow that old saying from
everyone's mom: "finish what you started before moving on to something
else".

Let's finish the composites in the current tables before extending them
further. Of course some(many) tables are finished to their current limits.
Extending them would be fine. [IMHO]

[QUOTE=R.D. Silverman;99106]Interest is in the mind of the beholder.

While others are free to disagree, I like to follow that old saying from
everyone's mom: "finish what you started before moving on to something
else".

Let's finish the composites in the current tables before extending them
further. Of course some(many) tables are finished to their current limits.
Extending them would be fine. [IMHO][/QUOTE]

Absolutely. However, while mum was saying "finish what you started", dad was saying "pick the easy fruit". I was always more in tune with my dad. It's not as if the above contribution adds any composites to your list, is it?

It's fine by me if you all stick with the table sizes you currently have. While you're crunching and pondering, I shall just do a little playing with 4+3 on my own, just above the curent limit. I'll stop when my factor-fu runs out, and mail the results to Paul.

In fact, it's _BEST_ that you stick with your current table sizes, as that guarantees I won't tread on your feet, and you won't tread on mine!

Good luck, and happy cracking!

Can someone provide me a Windows binary of the ECMnet client?
I have problems compiling it using MinGW. :sad:

[QUOTE=Mystwalker;99114]Can someone provide me a Windows binary of the ECMnet client?
I have problems compiling it using MinGW. :sad:[/QUOTE]

PM me and I'll help you through it.

[QUOTE=R.D. Silverman;99106]Of course some(many) tables are finished to their current limits.
Extending them would be fine. [IMHO][/QUOTE]

4+3 is going swimmingly - 14 numbers with n<450 factored entirely into primes already.

Does anyone have a list of which tables are complete, as it definitely makes sense for me to tackle those first? I can check each of them visually, of course, but it's a little silly wasting rediscovering what must be known already by someone else.

Cheers.

A few more using ggnfs...

3,2,423-
40050728809665918341807625331879282725073 (pp41)
8134978908042378271803748170526239618441302677876525086103854457 (pp64)

3,2,453-
6676632590964208825396334228342354209771 (pp40)
599878487246280284322128088052605483901086976792443398306028697757269834920853652059 (pp84)

3,2,477-
82327127448295702472460630418829909103320083693346528705489737 (pp62)
1154997774400006696506966460097996719354572617984091577090814283607651 (pp70)

Greg

5,3,232+
 

[QUOTE=frmky;99150]A few more using ggnfs...

3,2,423-
40050728809665918341807625331879282725073 (pp41)
8134978908042378271803748170526239618441302677876525086103854457 (pp64)

3,2,453-
6676632590964208825396334228342354209771 (pp40)
599878487246280284322128088052605483901086976792443398306028697757269834920853652059 (pp84)

3,2,477-
82327127448295702472460630418829909103320083693346528705489737 (pp62)
1154997774400006696506966460097996719354572617984091577090814283607651 (pp70)

Greg[/QUOTE]

Here is 5,3,232+ C141 = p50.p91

26843969937530333761249800502959894270020371382177
7610415523761447759258242192425661313539297198350880938336463550567931272741323853171836641

5,4,239+ is in progress. 5,4,239- and 5,3,244+ will follow.