Factoring compltely low mersenne numbers
 

i am interested in factoring all the low mersenne numbers from n = 2+
what is the quickest way of doing this
are there any programs that will automatically output and then go on to the next mersenne number
thanks henryzz

Will Edgington collects factors of Mersenne numbers. His web site was updated recently. Start there so you don't have to rediscover known factorizations. You'll need to know a bit about algebraic factors to use that information fully.

[url]http://www.garlic.com/~wedgingt/mersenne.html[/url]

The Cunningham Project is working on factorizations of these and other small bases. There is an active group here with its own forum.

[url]http://www.mersenneforum.org/forumdisplay.php?f=51[/url]

[B]Warning:[/B] Small Mersenne numbers are probably the most popular targets of factoring, so you are unlikely to find any easy targets left.

[QUOTE=henryzz;113916]i am interested in factoring all the low mersenne numbers from n = 2+
what is the quickest way of doing this
are there any programs that will automatically output and then go on to the next mersenne number
thanks henryzz[/QUOTE]

A number of people are interested in the same subject.

The "quickest" way is to use ECM in combination with SNFS and GNFS.

The smallest unfactored numbers require very large resources and a fair
bit of knowledge. They are almost certainly out of reach for you. They
are mostly out of reach for ME and I've been doing this for 25 years.
(I lack the needed CPU resources)

that is what i have been doing ECM and GNFS
i thought people must have made a list of all the factors but i couldnt find it
what exponent have they gone up to
i currently only have a 126 digit factor left of M1470

[QUOTE=henryzz;113945]that is what i have been doing ECM and GNFS
i thought people must have made a list of all the factors but i couldnt find it
what exponent have they gone up to
i currently only have a 126 digit factor left of M1470[/QUOTE]M1470 = 2^1470-1 = (2^735+1)(2^735-1), with more algebraic factors easily found.

Now do a Google search for "Cunningham tables" and you should find the factors of that C126.

Paul

[quote]i thought people must have made a list of all the factors but i couldnt find it[/quote][COLOR=White].[/COLOR]

[QUOTE=henryzz;113945]that is what i have been doing ECM and GNFS
i thought people must have made a list of all the factors but i couldnt find it
what exponent have they gone up to
i currently only have a 126 digit factor left of M1470[/QUOTE]

Repeat after me: "Google is my friend".

You can also type 2^1470-1 on my [URL="http://www.alpertron.com.ar/ECM.HTM"]factorization applet[/URL] and it will find its factors very quickly. This is because I loaded the latest Brent's and Edgington's tables on my Web server.

for some reason it isnt doning that for me
i have the cunningham tables box checked

i have used ur applet loads
is there any way of making it do a loop outputing as it goes along

[QUOTE=henryzz;113990]for some reason it isnt doning that for me
i have the cunningham tables box checked

i have used ur applet loads
is there any way of making it do a loop outputing as it goes along[/QUOTE]

Are you a child? Do you want EVERYTHING handed to you???

it often finds numbers composite when they are not it has found 11 was composite for me once