mersenneforum.org  

Go Back   mersenneforum.org > Factoring Projects > Factoring

Reply
 
Thread Tools
Old 2003-08-08, 06:33   #1
hyh1048576
 
Jun 2003

4016 Posts
Default Post the numbers you have tried to factor here

Post the numbers you have tried to factor (without success) and how much work you have done here. Maybe someone will go on with your number------For example, maybe me :)
hyh1048576 is offline   Reply With Quote
Old 2003-08-08, 11:41   #2
xilman
Bamboozled!
 
xilman's Avatar
 
"๐’‰บ๐’ŒŒ๐’‡ท๐’†ท๐’€ญ"
May 2003
Down not across

101100100111102 Posts
Default Re: Post the numbers you have tried to factor here

Quote:
Originally Posted by hyh1048576
Post the numbers you have tried to factor (without success) and how much work you have done here. Maybe someone will go on with your number------For example, maybe me :)
If anyone takes up this offer, I hope they post a pointer to the numbers and not the numbers themselves.

To get the ball rolling, I'm currently working on generalized Cullen and Woodall numbers. All have had ECM run to 25 digits. and some a little more. There are 14067 unfactored composites, which is why I post the URL http://research.microsoft.com/~pleyl...oodall/gcw.htm rather than the numbers themselves.

You will find other integers I'm interested in on links within http://research.microsoft.com/~pleyl...ation/main.htm


Paul

Last fiddled with by smh on 2003-10-18 at 22:45
xilman is offline   Reply With Quote
Old 2003-08-08, 13:25   #3
rogue
 
rogue's Avatar
 
"Mark"
Apr 2003
Between here and the

3×17×131 Posts
Default

I have been working on Home Primes at Sander Hoogendoorn's website at http://home.zonnet.nl/sander.hoogend...oendprime.html for a long time, but have been stuck for months without finding a new factor. There is the possibility that I broke GMP because I had been coding and testing some improvements to mpn routines earlier this year, but I'm fairly certain that I removed those changes and rebuilt the library before resuming my search. Of course I could just be unlucky as most of the composites are over 110 digits and have had enough ECM curves to find factors up to 40 digits. HP(49) has not been found yet. The current composite is 204 digits. More info can be found at http://www.worldofnumbers.com/em_topic1.htm.
rogue is online now   Reply With Quote
Old 2003-08-08, 18:49   #4
smh
 
smh's Avatar
 
"Sander"
Oct 2002
52.345322,5.52471

29×41 Posts
Default

Hi Mark,

I missed the progress on HP(49). It happened while i was away for holidays. I'll try to update asap, but yesterday i reinstalled my computer (new disk) and haven't restored any of the data yet, so it might take a couple of days.

To be honest, i haven't done any ECM on these numbers lately. I might consider doing some 3M curves on that C204.

Before my holidays i did factor quite a few numbers with SNFS from Paul's site. At the moment i don't have a pc available in the office to run long snfs runs, and at home it's to hot currentely to keep my pc running for hours. Only helping Wblipp with some ECM at the moment.
smh is offline   Reply With Quote
Old 2003-08-08, 22:15   #5
apocalypse
 
Feb 2003

2·3·29 Posts
Default

I have done a fair amount of work over the past few years on various Fermat numbers (status page), but to no avail. I gave up on them and started a LMH range instead, but I'll probably go back eventually. :)
apocalypse is offline   Reply With Quote
Old 2003-08-09, 18:33   #6
alpertron
 
alpertron's Avatar
 
Aug 2002
Buenos Aires, Argentina

2×727 Posts
Default

I'm factoring numbers near a googolplex using trial division. A googolplex is a one followed by a googol zeros, i.e., 10^100 zeros.

You can find the results at:

http://www.alpertron.com.ar/GOOGOL.HTM (googolplex to googolplex+999) and

http://www.alpertron.com.ar/GOOGOLM.HTM (googolplex-999 to googolplex)
alpertron is offline   Reply With Quote
Old 2003-08-10, 01:57   #7
rogue
 
rogue's Avatar
 
"Mark"
Apr 2003
Between here and the

3·17·131 Posts
Default

Unfortunately I don't have SNFS or source code to build it. I don't know if it is x86 specific or can be compiled on ther CPUs. I also don't know what resources are required to run it (lots of GHz hours, etc.?). Does anyone have a link to source code for SNFS?

The main reason I like Sander's project is that it is small and probably finite in size, although that is unknown. Granted one could expand to higher numbers to find home primes, but at this time I don't know if a home prime will be found for each value < 1000. I like the idea of knocking a few more off the list. I also like the idea that most of the remaining composites should have primes factors over 45 digits, but small enough to be found with ECM, thus getting the person who finds such a factor into Richard Brent's Top 100 ECM factors table.

BTW, another interesting factoring project is at http://www.fermatsearch.org. It doesn't use ECM but a pre-built Windows client is available and [selfish plug] a compile-it-yourself client that uses GMP is also available for other CPUs [/selfish plug]. The nice thing about this project is that you get a little more notoriety for finding a new factor of a Fermat number.

As for Paul Leyland's GC/GW factorization, its will take many years to factor all of those numbers and that most likely will not happen in my lifetime. Perhaps more algebraic factorizations can be found that could shorten his list significantly. What I do like about his project is that with so many candidates, it shouldn't be difficult to find a composite with B1=1e6. I can't speak for P+1 or P-1 factoring. I know that I tried hundreds of his composites with P-1/P+1 and B1=1e6 with no luck. I assume that someone else might have done that work.

Of course things would change if a quantum computer of sufficient size became reality, which seems to be possible with the direction of today's technology. But if that happens, ECM/QS/NFS factoring would become passe quickly.

--Mark
rogue is online now   Reply With Quote
Old 2003-08-13, 09:40   #8
BotXXX
 
BotXXX's Avatar
 
Aug 2003
Europe

2×97 Posts
Default

I have also got a little factorization effort here.

http://people.zeelandnet.nl/flaters/gmpecm.htm

It tries to factor Lucas numbers with GMP-ECM methods. ALtho the server it self is still wel not behind a decent router and the client doesn't support proxies to goodly. But ok. There is source and prebuilt downloads available.. ANd stats are being maintaind but still need to write a decent front for it so that is why it is not visable for now.

Current Lucas GMP-ECM server runs at 217.19.25.214 at ports 23, 80 and 110

So if you are intressted and or tempted to try it out ;) be my guest.
BotXXX is offline   Reply With Quote
Old 2003-08-13, 13:14   #9
xilman
Bamboozled!
 
xilman's Avatar
 
"๐’‰บ๐’ŒŒ๐’‡ท๐’†ท๐’€ญ"
May 2003
Down not across

2×5,711 Posts
Default

Quote:
Originally Posted by smh
I missed the progress on HP(49).

To be honest, i haven't done any ECM on these numbers lately. I might consider doing some 3M curves on that C204.
I recommend not doing so. Alex Kruppa and I (actually, almost entirely Alex) have run B1=11M to completion. That's the point I gave up but Alex is continuing with B1=44M. I may run some more ECM later but have no plans to do so at the moment.

If you want to run ECM, I recommend starting at B1=44M and to confer with Alex so that you keep each other informed on progress.


Paul

Last fiddled with by smh on 2003-10-18 at 22:47
xilman is offline   Reply With Quote
Old 2003-11-18, 05:32   #10
ixfd64
Bemusing Prompter
 
ixfd64's Avatar
 
"Danny"
Dec 2002
California

23×3×103 Posts
Default

RSA numbers.
ixfd64 is offline   Reply With Quote
Old 2003-11-19, 05:35   #11
wpolly
 
wpolly's Avatar
 
Sep 2002
Vienna, Austria

3×73 Posts
Default

Prelimitive part of 460^800+1.
The number have 4 small prime factor and a c1687.
I've only tried 30 curves with B1=2k without success.
wpolly is offline   Reply With Quote
Reply

Thread Tools


Similar Threads
Thread Thread Starter Forum Replies Last Post
Do 2^p-1 numbers ever have the same first prime factor? a nicol Math 2 2017-07-22 11:26
NFSNET to factor my own numbers? skan NFSNET Discussion 5 2012-11-03 16:01
Can two Mersenne numbers share a factor? James Heinrich Math 57 2011-09-12 14:16
Post numbers - what now? henryzz Forum Feedback 26 2008-12-24 14:21
3-factor Carmichael numbers devarajkandadai Math 4 2008-12-06 04:16

All times are UTC. The time now is 02:20.


Thu Aug 11 02:20:15 UTC 2022 up 34 days, 21:07, 2 users, load averages: 1.33, 1.09, 1.10

Powered by vBulletin® Version 3.8.11
Copyright ©2000 - 2022, Jelsoft Enterprises Ltd.

This forum has received and complied with 0 (zero) government requests for information.

Permission is granted to copy, distribute and/or modify this document under the terms of the GNU Free Documentation License, Version 1.2 or any later version published by the Free Software Foundation.
A copy of the license is included in the FAQ.

โ‰  ยฑ โˆ“ รท ร— ยท โˆ’ โˆš โ€ฐ โŠ— โŠ• โŠ– โŠ˜ โŠ™ โ‰ค โ‰ฅ โ‰ฆ โ‰ง โ‰จ โ‰ฉ โ‰บ โ‰ป โ‰ผ โ‰ฝ โŠ โŠ โŠ‘ โŠ’ ยฒ ยณ ยฐ
โˆ  โˆŸ ยฐ โ‰… ~ โ€– โŸ‚ โซ›
โ‰ก โ‰œ โ‰ˆ โˆ โˆž โ‰ช โ‰ซ โŒŠโŒ‹ โŒˆโŒ‰ โˆ˜ โˆ โˆ โˆ‘ โˆง โˆจ โˆฉ โˆช โจ€ โŠ• โŠ— ๐–• ๐–– ๐–— โŠฒ โŠณ
โˆ… โˆ– โˆ โ†ฆ โ†ฃ โˆฉ โˆช โŠ† โŠ‚ โŠ„ โŠŠ โŠ‡ โŠƒ โŠ… โŠ‹ โŠ– โˆˆ โˆ‰ โˆ‹ โˆŒ โ„• โ„ค โ„š โ„ โ„‚ โ„ต โ„ถ โ„ท โ„ธ ๐“Ÿ
ยฌ โˆจ โˆง โŠ• โ†’ โ† โ‡’ โ‡ โ‡” โˆ€ โˆƒ โˆ„ โˆด โˆต โŠค โŠฅ โŠข โŠจ โซค โŠฃ โ€ฆ โ‹ฏ โ‹ฎ โ‹ฐ โ‹ฑ
โˆซ โˆฌ โˆญ โˆฎ โˆฏ โˆฐ โˆ‡ โˆ† ฮด โˆ‚ โ„ฑ โ„’ โ„“
๐›ข๐›ผ ๐›ฃ๐›ฝ ๐›ค๐›พ ๐›ฅ๐›ฟ ๐›ฆ๐œ€๐œ– ๐›ง๐œ ๐›จ๐œ‚ ๐›ฉ๐œƒ๐œ— ๐›ช๐œ„ ๐›ซ๐œ… ๐›ฌ๐œ† ๐›ญ๐œ‡ ๐›ฎ๐œˆ ๐›ฏ๐œ‰ ๐›ฐ๐œŠ ๐›ฑ๐œ‹ ๐›ฒ๐œŒ ๐›ด๐œŽ๐œ ๐›ต๐œ ๐›ถ๐œ ๐›ท๐œ™๐œ‘ ๐›ธ๐œ’ ๐›น๐œ“ ๐›บ๐œ”