![]() |
![]() |
#1 |
Jun 2004
UK
2138 Posts |
![]()
After downloading nofactor.cmp and messing with DECOMP to get it to compile I noticed that there are some "small" exponents which have no factors. The smallest is 1061 and has only been factored up to 2^58.
Does anyone mind if I try factoring these a bit? If there isn't a problem I'll continue, if there is just tell me and I'll stop. |
![]() |
![]() |
![]() |
#2 | |
"Sander"
Oct 2002
52.345322,5.52471
118910 Posts |
![]() Quote:
First, it would take a long time to take the factor level up one or two bits Second, the chance of succes is almost 0. There are other methods which are much more effective in factoring small numbers. As can be seen on this page, enough ECM curves have ben run to find almost all <45 digit factors (if they would exist). With factoring, you're limmited to something like 19 digits or so. |
|
![]() |
![]() |
![]() |
#3 |
Jun 2004
UK
100010112 Posts |
![]()
Bah, oh well. I have an urge to factor something and it just seemed interesting that these "small" numbers had no factors. Thanks for the warning.
|
![]() |
![]() |
![]() |
#4 | |
Mar 2003
New Zealand
13×89 Posts |
![]() Quote:
Otherwise a good place to find some quick factors from the exponents in nofactor.cmp with ECM might be in the 90000-100000 range, there should still be plenty of 20-25 digit factors still to be found and the curves don't take too long, about 140 seconds each on a P4 2.66. |
|
![]() |
![]() |
![]() |
#5 | |
Bamboozled!
"๐บ๐๐ท๐ท๐ญ"
May 2003
Down not across
5×31×73 Posts |
![]() Quote:
As already pointed out, running Prime95's ECM factoring gives you a good chance of finding eally quite large factors --- in the 40 through 55 digits range --- and possibly factors of record breaking size. This program is very efficient but very limited in that it works only for numbers of the form 2^n+1 and 2^n-1. If you would like to factor integers of other forms, there are a number of projects running. You could join NFSNET (http://www.nfsnet.org) or you could check out ECMNET (http://www.loria.fr/~zimmerma/records/ecmnet.html) for instance. Other projects you can find easily enough by the normal mechanisms, including search engines. Paul |
|
![]() |
![]() |
![]() |
#6 | |
"Mark"
Apr 2003
Between here and the
660110 Posts |
![]() Quote:
|
|
![]() |
![]() |
![]() |
#7 | |
Bamboozled!
"๐บ๐๐ท๐ท๐ญ"
May 2003
Down not across
5·31·73 Posts |
![]() Quote:
Paul |
|
![]() |
![]() |
![]() |
Thread Tools | |
![]() |
||||
Thread | Thread Starter | Forum | Replies | Last Post |
Using 16e on smaller numbers | fivemack | Factoring | 3 | 2017-09-19 08:52 |
Factoring Mersenne numbers | paulunderwood | Miscellaneous Math | 18 | 2017-08-27 14:56 |
NFS on smaller numbers? | skan | YAFU | 6 | 2013-02-26 13:57 |
Factoring Fermat numbers | siegert81 | Factoring | 12 | 2011-02-03 13:55 |
Factoring Big Numbers In c# | ShridharRasal | Factoring | 10 | 2008-03-20 17:17 |