- **Factoring**
(*https://www.mersenneforum.org/forumdisplay.php?f=19*)

- - **New ECM-server available**
(*https://www.mersenneforum.org/showthread.php?t=1039*)

New ECM-server availableI have set up a new ECM server !!
adress: mandelbrot.dynu.com port: 8194 available composites: numbers of form 2^n+1 and 2^n-1 If there are any problems please contact me at mandelbrot@gmx.net Statistics are now available under: www.ecmserver.de.vu andi314 |

:banana: Congratulation :banana:
to Martin Schroeder, aka McBryce !! He was the first who found a factor of a composite mersenne number on my server at mandelbrot.dynu.com. The factor is M( 9504 )C: 2776202386436268283691901876771457 (34 digits) found with B1=250000 and sigma= -176653509 Will Edgington has been informed so this will show up in the next release of lowM.txt. The remaining 714 :shock: digit composite is now available in the ecm server. More helpers are welcome - smh has put together the following to make it easy to join: [quote="smh"]I've put a zipfile (~800K) with the ecmclient and ecm.exe for various processors online [url=http://home.zonnet.nl/sander.hoogendoorn/ecm_client.zip]here[/url] Before you run ecmclient, put the right ecm.exe in the same folder and set the parameters in ecmclient.cfg[/quote] if you need any help please contact me at mandelbrot@gmx.net So now i'm interessted who will be the next one, who finds a factor of M(X) or P(X).. Yours andi314 |

Are the numbers on your server the [i]full[/i] M or P number or are they divided by known factors?
I ask because on a P4 (and probably other processors) prime95 is [b]much[/b] faster on M numbers, unless you can take advantage of a lot of known factors |

Most of the numbers are P(X) but there are also some M(X).
And all of this numbers aren't full numbers anymore, they are divided by known factors. andi314 |

All times are UTC. The time now is 09:16. |

Powered by vBulletin® Version 3.8.11

Copyright ©2000 - 2020, Jelsoft Enterprises Ltd.